Stopping set analysis for Hamming codes

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005

Volumn , Issue , 2005, Pages 244-247

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

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; COMPUTATIONAL COMPLEXITY; DECODING; MATRIX ALGEBRA;

ENUMERATORS; HAMMING CODES; PARITYCHECK MATRIX; STOPPING SET;

CODES (STANDARDS);

EID: 33749079028     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2005.1531897     Document Type: Conference Paper

References (5)

1. 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.
2. 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.
3. 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, November 2001.
4. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
5. R.J. McEliece, "Are there turbo-codes on Mars?," Shannon Lecture, 2004 IEEE International Symposium on Information Theory, Chicago, IL, USA, June 27 - July 2, 2004. The slides are available at the web site http://www.systems.caltech.edu/EE/Faculty/rjm/.