Extrinsic tree decoding

Proceedings - 43rd Annual Conference on Information Sciences and Systems, CISS 2009

Volumn , Issue , 2009, Pages 406-410

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

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING METHODS; FINITE COMPUTATIONS; ITERATIVE DECODER; LOW-DENSITY PARITY-CHECK CODES; UPPER BOUND;

CODES (SYMBOLS); INFORMATION SCIENCE;

ITERATIVE DECODING;

EID: 70349667441     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2009.5054754     Document Type: Conference Paper

References (7)

1. N. Wiberg, Codes and Decoding on General Graphs, Ph.D. thesis, Linkoping University, Linkoping, Sweden, 1996.
2. Y. Lu, C. Méasson, and A. Montanari, "TP decoding," in Proceedings of the 45th Annual Allerton Conference on Communication, Control, and Computing, September 2007.
3. 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.
4. D. J. C. MacKay and M. Postal, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," Electronic Notes in Theoretical Computer Science, 2003.
5. N. Axvig, D. Dreher, K. Morrison, E. Psota, L. C. Pérez, and J. L. Walker, "Analysis of connections between pseudocodewords," Submitted to IEEE Transactions on Information Theory, March 2008.
6. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 599-618, February 2001.
7. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity check codes," IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 619-637, February 2001.