Stopping set enumerators of full-rank parity-check matrices of hamming codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 1544-1548

  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

ENUMERATORS; FULL-RANK PARITY-CHECK; HAMMING CODES; PARITY-CHECK MATRIX;

CODES (SYMBOLS); COMPUTATIONAL METHODS; SET THEORY;

HAMMING DISTANCE;

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

References (7)

1. M. Abramowitz and I. A. Stegun (Eds.), Handbook of Mathematical Functions. Ninth printing. New York, NY: Dover, 1972.
2. L. Comtet, Advanced Combinatorics. Dordrecht, The Netherlands: Reidel, 1974.
3. C. Di, D. Proietti, I.E. Telatar, T.J. Richardson, and R.L. Urbanke "Finitelength 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. F. J. MacWilliams 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/.
6. J. Riordan, An Introduction to Combinatorial Analysis. Princeton, NJ: Princeton University Press, 1978.
7. 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.