On trapping sets and guaranteed error correction capability ofLDPC codes and GLDPC codes

IEEE Transactions on Information Theory

Volumn 56, Issue 4, 2010, Pages 1600-1611

  Chilappagari, Shashi Kiran ^a   Nguyen, Dung Viet ^b   Vasic, Bane ^b   Marcellin, Michael W ^b  

^a MARVELL SEMICONDUCTOR INC   (United States)

^b University of Arizona   (United States)

Author keywords

Bit flipping algorithms; Error correction capability; Fixed sets; Generalized low density parity check (LDPC) codes; Low density parity check (LDPC) codes; Trapping sets

Indexed keywords

BIT FLIPPING ALGORITHMS; ERROR CORRECTION CAPABILITY; FIXED SETS; LOW-DENSITY PARITY-CHECK CODES; TRAPPING SETS;

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); ERROR CORRECTION;

CODES (SYMBOLS);

EID: 77950225666     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2040962     Document Type: Article

References (28)

1. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: M.I.T. Press, 1963.
2. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol.27, pp. 533-547, Sep. 1981.
3. V. V. Zyablov and M. S. Pinsker, "Estimation of the error-correction complexity for Gallager low-density codes," Probl. Inf. Transm., vol.11, no.1, pp. 18-28, 1976.
4. M. Sipser and D. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol.42, pp. 1710-1722, Nov. 1996.
5. D. Burshtein and G. Miller, "Expander graph arguments for messagepassing algorithms," IEEE Trans. Inf. Theory, vol.47, pp. 782-790, Feb. 2001.
6. J. Feldman, T. Malkin, R. A. Servedio, C. Stein, and M. J.Wainwright, "LP decoding corrects a constant fraction of errors," IEEE Trans. Inf. Theory, vol.53, pp. 82-89, Jan. 2007.
7. J. Feldman, M. J. Wainwright, and D. R. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. Inf. Theory, vol.51, pp. 954-972, Mar. 2005.
8. D. Burshtein, "On the error correction of regular LDPC codes using the flipping algorithm," IEEE Trans. Inf. Theory, vol.54, pp. 517-530, Feb. 2008.
9. G. Zemor, "On expander codes," IEEE Trans. Inf. Theory, vol.47, pp. 835-837, Feb. 2001.
10. A. Barg and G. Zemor, "Error exponents of expander codes," IEEE Trans. Inf. Theory, vol.48, pp. 1725-1729, Jun. 2002.
11. H. Janwa and A. K. Lal, "On Tanner codes: Minimum distance and decoding," Appl. Algebra Eng. Commun. Comput., vol.13, no.5, pp. 335-347, 2003.
12. N. Miladinovic and M. Fossorier, "Generalized LDPC codes with Reed-Solomon and BCH codes as component codes for binary channels," in Proc. IEEE GLOBECOM, St. Louis, MO, Nov. 2, 2005, vol.3, pp. 6-10.
13. N. Alon, "Spectral techniques in graph algorithms," in LATIN '98: Proc. Third Latin American Symposium on Theoretical Informatics, London, U.K., 1998, pp. 206-215.
14. C. Di, D. Proietti, T. Richardson, E. Telatar, and R. Urbanke, "Finite length analysis of low-density parity-check codes," IEEE Trans. Inf. Theory, vol.48, pp. 1570-1579, Jun. 2002.
15. A. Orlitsky, R. Urbanke, K. Viswanathan, and J. Zhang, "Stopping sets and the girth of Tanner graphs," in Proc. IEEE Int. Symp. Inf. Theory, Lausanne, Switzerland, Jun. 5, 2002, pp. 2-2
16. N. Biggs, Algebraic Graph Theory. Cambridge, U.K.: Cambridge University Press, 1993.
17. T. J. Richardson, "Error floors of LDPC codes," in Proc. 41st Annu. Allerton Conf. Commun., Contr. Comput., Monticello, IL, Oct. 1-3, 2003, pp. 1426-1435.
18. P. O.Vontobel and R.Koetter, "Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes," IEEE Trans. Inf. Theory, May 2007.
19. S. K. Chilappagari, S. Sankaranarayanan, and B. Vasic, "Error floors of LDPC codes on the binary symmetric channel," in Proc. IEEE Int. Conf. Commun., Istanbul, Turkey, Jun. 11-15, 2006, vol.3, pp. 1089-1094.
20. B. Bollobas, Extremal Graph Theory. New York: Academic, 1978.
21. S. K. Chilappagari and B. Vasic, "Error correction capability of column-weight-three LDPC codes," IEEE Trans. Inf. Theory, vol.55, pp. 2055-2061, 2009.
22. T. J. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol.47, pp. 599-618, Feb. 2001.
23. N. Alon, S. Hoory, and M. Linial, "The Moore bound for irregular graphs," Graphs and Combinatorics, vol.18, no.1, pp. 53-57, 2002.
24. E. W. Weisstein, Cage Graph [Online]. Available: http://mathworld. wolfram.com/CageGraph.html
25. P. K.Wong, "Cages- a survey," J. Graph Theory, vol.6, no.1, pp. 1-22, 1982.
26. D. K. Garnick, Y. H. H. Kwong, and F. Lazebnik, "Extremal graphs without three-cycles or four-cycles," J. Graph Theory, vol.17, no.5, pp. 633-645, 1993.
27. Y. Yuansheng, L. Xiaohui, D. Guocheng, and Z. Yongxiang, "Extremal graphs without three-cycles, four-cycles or five-cycles," Utilitas Mathematica, vol.66, pp. 249-266, 2004.
28. Y.Wang and M. Fossorier, "Doubly generalized LDPC codes," in Proc. IEEE Int. Symp. Inf. Theory, Seattle,WA, Jul. 9-14, 2006, pp. 669-673.