Trapping set ontology

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Volumn , Issue , 2009, Pages 1-7

  Vasić, Bane ^a   Chilappagari, Shashi Kiran ^a   Nguyen, Dung Viet ^a   Planjery, Shiva Kumar ^a  

^a University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVE WHITE GAUSSIAN NOISE CHANNEL; BINARY SYMMETRIC CHANNEL; CODING THEORY; COMBINATORIAL OBJECTS; CRITICAL NUMBERS; ERROR FLOOR; ERROR-FLOOR REGION; ITERATIVE CODING; ITERATIVE DECODER; LOW-DENSITY PARITY-CHECK CODES; SYSTEMATIC METHOD; TOPOLOGICAL RELATIONS; TRAPPING SETS;

COMPUTER PROGRAMMING; DECODING; FLOORS; GAUSSIAN NOISE (ELECTRONIC); INFORMATION THEORY; WHITE NOISE;

ONTOLOGY;

EID: 77949576098     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2009.5394825     Document Type: Conference Paper

References (16)

1. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: M.I.T. Press, 1963.
2. 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.
3. S. K. Chilappagari, M. Chertkov, M. G. Stepanov, and B. Vasic, "Instanton-based techniques for analysis and reduction of error floors of LDPC codes," IEEE JSAC on Capacity Approaching Codes, vol. 27, no. 6, pp. 855-865, Aug. 2009.
4. C. Di, D. Proietti, T. Richardson, E. Telatar, and R. Urbanke, "Finite length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. on Inform. Theory, vol. 48, no. 6, pp. 1570-1579, June 2002.
5. T. J. Richardson, "Error floors of LDPC codes," in Proc. 41st Annual Allerton Conf. on Communications, Control and Computing, 2003, pp. 1426-1435. [Online]. Available: http://www.hpl.hp.com/personal/Pascal\- Vontobel/pseudocodewords/papers
6. S. K. Chilappagari, S. Sankaranarayanan, and B. Vasic, "Error floors of LDPC codes on the binary symmetric channel," in Proc. Int. Conf. on Communications, vol. 3, 2006, pp. 1089-1094.
7. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. 27, no. 5, pp. 533-547, Sept. 1981.
8. S. Chilappagari and B. Vasic, "Error-correction capability of column-weight-three LDPC codes," IEEE Trans. Inform. Theory, vol. 55, no. 5, pp. 2055-2061, May 2009.
9. S. K. Chilappagari, D. V. Nguyen, B. Vasic, and M. W. Marcellin, "On trapping sets and guaranteed error correction capability of LDPC codes and GLDPC codes," May 2008, to appear in IEEE Trans. Inform. Theory. [Online]. Available: http://arxiv.org/abs/0805.2427
10. M. Ivkovic, S. K. Chilappagari, and B. Vasic, "Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers," IEEE Trans. Inform. Theory, vol. 54, no. 8, pp. 3763-3768, 2008.
11. S. K. Chilappagari, A. R. Krishnan, and B. Vasic, "LDPC codes which can correct three errors under iterative decoding," in Proc. of IEEE Information Theory Workshop, Porto, Portugal, May 5-9, 2008, pp. 406-410.
12. B. Vasic, S. K. Chilappagari, S. Sankaranarayanan, and R. Radhakrishnan, "Failures of the Gallager B decoder: analysis and applications," in Proc. 2nd Information Theory and Applications Workshop. University of California at San Diego, Feb. 2006. [Online]. Available: http://ita.ucsd.edu/ workshop/06/papers/160.pdf
13. P. J. Cameron and J. H. V. Lint, Graphs, Codes and Designs. New York, NY, USA: Cambridge University Press, 1980.
14. "Trapping set ontology." [Online]. Available: http://www.ece.arizona. edu/~vasiclab/Projects/CodingTheory/TrappingSetOntology. html
15. S. K. Chilappagari, B. Vasic, M. Stepanov, and M. Cherktov, "Analysis of error floor of LDPC codes under LP decoding over the BSC," in Proc. IEEE International Symposium on Information Theory (ISIT'09), Seoul, Korea, July 2009, pp. 379-383.
16. X. Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. on Inform. Theory, vol. 51, no. 1, pp. 386-398, 2005.