Generalized stopping sets and stopping redundancy

2007 Information Theory and Applications Workshop, Conference Proceedings, ITA

Volumn , Issue , 2007, Pages 400-404

  Abdel Ghaffar, Khaled A S ^a   Weber, Jos H ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; CHLORINE COMPOUNDS; CODES (STANDARDS); CODES (SYMBOLS); CYBERNETICS; DECODING; INFORMATION THEORY; QUALITY ASSURANCE; REDUNDANCY; RELIABILITY; SET THEORY; SPECIFICATIONS;

BASIC PROPERTIES; ERASURE CHANNEL; ITERATIVE DECODERS; LINEAR BLOCK CODING; OPTIMAL DECODING; OVER-ERASURE; STOPPING SETS; SYSTEM OF EQUATIONS; SYSTEM SPECIFICATIONS;

ITERATIVE DECODING;

EID: 48049115504     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2007.4357610     Document Type: Conference Paper

References (18)

1. K.A.S. Abdel-Ghaffar and J.H. Weber, "Stopping set enumerators of full-rank parity-check matrices of Hamming codes," Proceedings of the IEEE International Symposium on Information Theory, Seattle, WA, USA, pp. 1544-1548, July 9-14, 2006.
2. K.A.S. Abdel-Ghaffar and J.H. Weber, "On parity-check matrices with optimal stopping and/or dead-end set enumerators," Proceedings of Turbo Coding 2006, Munich, Germany, April 3-7, 2006.
3. D. Burshtein and G. Miller, "Asymptotic enumeration methods for analyzing LDPC codes," IEEE Trans. Inform. Theory, vol. 50, no. 6, pp. 1115-1131, June 2004.
4. 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.
5. T. Etzion, "On the stopping redundancy of Reed-Muller codes," IEEE Trans. Inform. Theory, vol. 52, no. 11, pp. 4867-4879, November 2006.
6. J. Han and P. H. Siegel. (2005, November). Improved upper bounds on stopping redundancy. arXiv:cs.IT/0511056. [Online]. Available: http://www.arxiv.org/list/cs.IT/0511
7. H. D. L. Hollmann and L. M. G. M. Tolhuizen. (2005, July). On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size. arXiv:cs.IT/0507068. [Online]. Available: http://www.arxiv.org/list/cs.IT/0507
8. R. Ikegaya, K. Kasai, T. Shibuya, and K. Sakaniwa, "Asymptotic weight and stopping set distributions for detailedly represented irregular LDPC code ensembles," Proceedings of the IEEE International Symposium on Information Theory, Chicago, USA, p. 208, June 27 - July 2, 2004.
9. N. Kashyap and A. Vardy, "Stopping sets in codes from designs," Proceedings of the IEEE International Symposium on Information Theory, Yokohama, Japan, p. 122, June 29 - July 4, 2003.
10. C. Kelley, D. Sridhara, J. Xu, and J. Rosenthal, "Pseudocodeword weights and stopping sets," Proceedings of the IEEE International Symposium on Information Theory, Chicago, USA, p. 67, June 27 - July 2, 2004.
11. M.G. Luby, M. Mitzenbacher, M.A. Shokrollahi, and D.A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 569-584, February 2001.
12. A. Orlitsky, R. Urbanke, K. Viswanathan, and J. Zhang, "Stopping sets and the girth of Tanner graphs," Proceedings of the IEEE International Symposium on Information Theory, Lausanne, Switzerland, p. 2, June 30 - July 5, 2002.
13. A. Orlitsky, K. Viswanathan, and J. Zhang, "Stopping set distribution of LDPC code ensembles," IEEE Trans. Inform Theory, vol. 51, no. 3, pp. 929-953, March 2005.
14. M. Schwartz and A. Vardy, "On the stopping distance and the stopping redundancy of codes," IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 922-932, March 2006.
15. J.H. Weber and K. A. S. Abdel-Ghaffar, "Stopping set analysis for Hamming codes," Proceedings of the Information Theory Workshop on Coding and Complexity, Rotorua, New Zealand, pp. 244-247, August 28-September 1, 2005.
16. J.H. Weber and K.A.S. Abdel-Ghaffar,"On decoding failure probabilities for linear block codes on the binary erasure channel," Proceedings of the IEEE Information Theory Workshop, Chengdu, China, pp. 24-28, October 22-26, 2006.
17. S.-T. Xia and F.-W. Fu, "On the stopping distance of finite geometry LDPC codes," IEEE Commun. letters, vol. 10, no. 5, pp. 381-383, May 2006.
18. S.-T. Xia and F.-W. Fu, "Stopping set distributions of some linear codes," Proceedings of the IEEE Information Theory Workshop, Chengdu, China, pp. 47-51, October 22-26, 2006.