An algorithm to find all small-size stopping sets of low-density parity-check matrices

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 2936-2940

  Rosnes, Eirik ^a   Ytrehus, Øyvind ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

STOPPING SETS;

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER NETWORKS; CYBERNETICS; DIESEL ENGINES; INFORMATION THEORY; MATRIX ALGEBRA; TECHNICAL PRESENTATIONS; TRANSCEIVERS; TURBO CODES;

SET THEORY;

EID: 51649112640     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557664     Document Type: Conference Paper

References (30)

1. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. 8, no. 1, pp. 21-28, Jan. 1962.
2. D. J. C. MacKay and R. M. Neal, "Good codes based on very sparse matrices," in Proc. 5th IMA Conf. on Cryptography and Coding (Lecture Notes in Computer Science), vol. 1025, Royal Agricultural College, Cirencester, UK, Dec. 1995, pp. 100-111.
3. T. J. Richardson and R. L. 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.
4. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
5. Y. Mao and A. H. Banihashemi, "Aheuristic search for good low-density parity-check codes at short block lengths," in Proc. IEEE Int. Conf. Commun. (ICC), vol. 1, Helsinki, Finland, June 2001, pp. 41-44.
6. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
7. O. Y. Takeshita, "A compact constmction for LDPC codes using permutation polynomials," in Proc. IEEE Int. Symp. on Inform. Theory (ISIT), Seattle, WA, July 2006, pp. 79-82.
8. C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1570-1579, June 2002.
9. D. J. C. MacKay and M. S. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," in Proc. Second Irish Conf. Mathematical Foundations of Computer Science and Information Technology (Electronic Notes in Theoretical Computer Science), vol. 74, Galway, Ireland, July 2002.
10. T. Richardson, "Error floors of LDPC codes," in Proc. 41st Annual Allerton Conf. on Commun., Control, and Computing, Monticello, IL, Oct. 2003, pp. 1426-1435.
11. P. O. Vontobel and R. Koetter, "Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes," 2005, IEEE Trans. Inform. Theory, submitted for publication. [Online], Available: http://arxiv.org/abs/cs.IT/0512078/
12. E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, "On the inherent intractability of certain coding problems," IEEE Trans. Inform. Theory, vol. 24, no. 3, pp. 384-386, May 1978.
13. A. Vardy, "The intractability of computing the minimum distance of a code," IEEE Trans. Inform. Theory, vol. 43, no. 6, pp. 1757-1766, Nov. 1997.
14. K. M. Krishnan and P. Shankar, "On the complexity of finding stopping distance in Tanner graphs," 2005. [Online]. Available: http://arxiv.org/abs/cs.IT/0512101/
15. C.-C. Wang, S. R. Kulkami, and H. V. Poor, "Exhausting error-prone patterns in LDPC codes," 2006, IEEE Trans. Inform. Theory, submitted for publication. [Online], Available: http://arxiv.org/abs/cs.IT/0609046/
16. X.-Y Hu, M. P. C. Fossorier, and E. Eleftheriou, "On the computation of the minimum distance of low-density parity-check codes," in Proc. IEEE Int. Conf. Commun. (ICC), vol. 2, Paris, France, June 2004, pp. 767-771.
17. M. Hirotomo, M. Mohri, and M. Morii, "A probabilistic computation method for the weight distribution of low-density parity-check codes," in Proc. IEEE Int. Symp. on Inform. Theory (ISIT), Adelaide, SA, Australia, Sept. 2005, pp. 2166-2170.
18. X.-Y Hu and E. Eleftheriou, "A probabilistic subspace approach to the minimal stopping set problem," in Proc. 4th Int. Symp. on Turbo Codes & Related Topics, Munich, Germany, Apr. 2006.
19. G. Richter, "Finding small stopping sets in the Tanner graphs of LDPC codes," in Proc. 4th Int. Symp. on Turbo Codes & Related Topics, Munich, Germany, Apr. 2006.
20. M. P. C. Fossorier, "Iterative reliability-based decoding of low-density parity-check codes," IEEE J. Select. Areas Commun., vol. 19, no. 5, pp. 908-917, May 2001.
21. E. Rosnes and Ø. Ytrehus, "Turbo decoding on the binary erasure channel: Finite-length analysis and turbo stopping sets," 2006, IEEE Trans. Inform. Theory, submitted for publication. [Online]. Available: http://arxiv.org/abs/cs.IT/0602072/
22. _, "Turbo stopping sets: The uniform interleaver and efficient enumeration," in Proc. IEEE Int. Symp. on Inform. Theory (ISIT), Adelaide, SA, Australia, Sept. 2005, pp. 1251-1255.
23. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform, Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
24. H. Pishro-Nik and F. Fekri, "On decoding of low-density parity-check codes over the binary erasure channel," IEEE Trans. Inform. Theory, vol. 50, no. 3, pp. 439-454, Mar. 2004.
25. R. M. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured LDPC codes," in Proc. Int. Symp. on Commun. Theory and Appl. (ISCTA), Ambleside, England, July 2001.
26. D. J. C. MacKay, Encyclopedia of sparse graph codes. [Online], Available: http://www.inference.phy.cam.ac.uk/mackay/codes/data.html
27. G. A. Margulis, "Explicit constructions of graphs without short cycles and low density codes," Combinatorica, vol. 2, no. 1, pp. 71-78, 1982.
28. J. Rosenthal and P. O. Vontobel, "Constmction of LDPC codes based on Ramanujan graphs and ideas from Margulis," in Proc. 38th Annual Allerton Conf. on Commun., Control, and Computing, Monticello, IL, Oct. 2000, pp. 248-257.
29. 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.
30. M. Stepanov and M. Chertkov, "Instanton analysis of low-density parity-check codes in the error-floor regime," in Proc. IEEE Int. Symp. on Inform. Theory (ISIT), Seattle, WA, July 2006, pp. 552-556.