Generalized iterative decoding for linear block codes on the binary erasure channel

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 66-70

  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; CODES (SYMBOLS); COMPUTER NETWORKS; CYBERNETICS; INFORMATION THEORY; SPECIFICATIONS; TECHNICAL PRESENTATIONS;

ITERATIVE DECODING;

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

References (14)

1. 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.
2. K.A.S. Abdel-Ghaffar and J.H. Weber, "Generalized stopping sets and stopping redundancy," 2007 Information Theory and Applications (ITA) Workshop, San Diego, CA, USA, Jan. 29 - Feb. 2, 2007.
3. 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.
4. T. Etzion, "On the stopping redundancy of Reed-Muller codes," IEEE Trans. Inform. Theory, vol. 52, no. 11, pp. 4867-4879, November 2006.
5. J. Han and P. H. Siegel, "Improved upper bounds on stopping redundancy," IEEETrans. Inform. Theory, vol. 53, no. 1, pp. 90-104, January 2007.
6. H. D. L. Hollmann and L. M. G. M. Tolhuizen, "On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size," IEEE Trans. Inform. Theory, vol. 53, no. 2, pp. 823-828, February 2007.
7. 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.
8. 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.
9. 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.
10. 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.
11. 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, March 2004.
12. 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.
13. 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.
14. 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.