LDPC codes which can correct three errors under iterative decoding

2008 IEEE Information Theory Workshop, ITW

Volumn , Issue , 2008, Pages 406-410

  Chilappagari, Shashi Kiran ^a   Krishnan, Anantha Raman ^a   Vasić, Bane ^b  

^a University of Arizona   (United States)

^b University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (STANDARDS); CODES (SYMBOLS); CYBERNETICS; DECODING; ERRORS; INFORMATION THEORY;

CODE PERFORMANCE; CONSTRUC TION TECHNIQUES; LDPC CODING; NECESSARY AND SUFFICIENT CONDITIONS; SIMULATION RESULTS;

ITERATIVE DECODING;

EID: 51849111049     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2008.4578696     Document Type: Conference Paper

References (19)

1. T. J. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding, " IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
2. T. J. Richardson, M. Shokrollahi, and R. Urbanke, "Design of capacityapproaching irregular low-density parity-check codes, " IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.
3. D. J. C. MacKay and M. J. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," in Proc. of MFCSIT2002, Galway, ser. Electronic Notes in Theoretical Computer Science, vol. 74. Elsevier, 2003. [Online]. Available: http://www.inference.phy.cam.ac. uk/mackay/abstracts/margulis.html
4. T. J. Richardson, "Error floors of LDPC codes," in Proc. of 41st Annual Allerton Conf. on Communications, Control and Computing, 2003, pp. 1426-1435.
5. C. Di, D. Proietti, T. Richardson, E. Telatar, and R. Urbanke, "Finite length analysis of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 48, pp. 1570-1579, June 2002.
6. M. G. Stepanov, V. Chernyak, M. Chertkov, and B. Vasic, "Diagnosis of weaknesses in modern error correction codes: A physics approach," Phys. Rev. Lett., vol. 95, p. 228701, Nov. 2005.
7. P. O. Vontobel and R. Koetter, "Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes," 2005. [Online]. Available: http://www.citebase.org/abstract?id=oai: arXiv.org: cs/0512078
8. R. Smarandache and P. O. Vontobel, "Pseudo-codeword analysis of Tanner graphs from projective and Euclidean planes," IEEE Trans. Inform. Theory, vol. 53, no. 7, pp. 2376-2393, July 2007.
9. R. Smarandache, A. E. Pusane, P. O. Vontobel, and D. J. Costello, "Pseudo-codewords in LDPC convolutional codes," in Proc. of International Symposium on Information Theory, July 2006, pp. 1364-1368.
10. S. K. Chilappagari, S. Sankaranarayanan, and B. Vasic, "Error floors of LDPC codes on the binary symmetric channel," in Proc. of International Conference on Communications, vol. 3, June 11-15 2006, pp. 1089-1094.
11. D. Burshtein and G. Miller, "Expander graph arguments for message-passing algorithms," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 782-790, Feb. 2001.
12. X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inform. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.
13. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: M.I.T. Press, 1963.
14. A. Shokrollahi, "An introduction to low-density parity-check codes," in Theoretical aspects of computer science: advanced lectures. New York, NY, USA: Springer-Verlag New York, Inc., 2002, pp. 175-197.
15. S. K. Chilappagari and B. Vasic, "LDPC codes which can correct fixed number of errors under iterative decoding," in preparation.
16. --, "Error correction capability of column-weight-three LDPC codes," submitted to IEEE Trans. Inform. Theory. [Online]. Available: http://arxiv.org/abs/0710.3427
17. S. Sankaranarayanan, S. K. Chilappagari, R. Radhakrishnan, and B. Vasic, "Failures of the Gallager B decoder: Analysis and applications," in Proc. of UCSD Center for Information Theory and its Applications Inaugural Workshop, Feb 6-9 2006. [Online]. Available: htpp//ita.5i.net/papers/160.pdf
18. M. Ivkovic, S. K. Chilappagari, and B. Vasic, "Eliminating trapping sets in low-density parity check codes using Tanner graph lifting," in Proc. of International Symposium on Information Theory, June 24-29 2007, pp. 2266-2270.
19. D. J. C. MacKay, "Encyclopedia of sparse graph codes." [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/ codes/data.html