LDPC decoding and code design on extrinsic trees

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 2161-2165

  Psota, Eric ^a   Pérez, Lance C ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODE DESIGNS; DECODING ALGORITHM; FINITE COMPUTATIONS; ITERATIVE DECODER; LOW-DENSITY PARITY-CHECK CODES; TANNER GRAPHS; TREE ALGORITHMS; UPPER BOUND;

INFORMATION THEORY; ITERATIVE DECODING; TURBO CODES;

GRAPH THEORY;

EID: 70449484514     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205794     Document Type: Conference Paper

References (10)

1. G. D. Forney, Jr., R. Koetter, F. R. Kschischang, and A. Reznik, "On the effective weights of pseudocodewords for codes defined on graphs with cycles," in Codes, systems, and graphical models (Minneapolis, MN, 1999), vol. 123 of IMA Vol. Math. Appl., pp. 101-112. Springer, New York, 2001.
2. D. J. C. MacKay and M. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," Electronic Notes in Theoretical Computer Science, 2003.
3. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite-length codes," in Proceedings of the IEEE International Symposium on Turbo Codes and Applications, Brest, France, Sept. 1-5 2003, pp. 75-82.
4. N. Axvig, D. Dreher, K. Morrison, E. Psota, L. C. Pérez, and J. L. Walker, "Analysis ofconnections between pseudocodewords," To appear in IEEE Transactions on Information Theory, April 2009.
5. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Transactions on lriformation Theory, vol. 47, no. 2, pp. 599-618, February 2001.
6. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacityapproaching irregular low-density parity check codes," IEEE Transactions on Iriformation Theory, vol. 47, no. 2, pp. 619-637, February 2001.
7. N. Wiberg, Codes and Decoding on General Graphs, Ph.D. thesis, Linkiiping University, Linköping, Sweden, 1996.
8. Y. Lu, C. Méasson, and A. Montanari, "TPdecoding," in Proceedings of the 45th Annual Allerton Coriference on Communication, Control, and Computing, September 2007.
9. E. Psota and L. C. Pérez, "Extrinsic tree decoding," in Proceedings of the 2009 Coriference on Iriformation Sciences and Systems, March 2009.
10. C. Kelley and D. Sridhara, "On the pseudocodeword weight and paritycheck matrix redundancy of linear codes," in Proceedings of the 2007 IEEE Information Theory Workshop, Tahoe City, CA, September 2007, pp. 1-6.