DocumentCode
2946075
Title
Stopping Set Enumerators of Full-Rank Parity-Check Matrices of Hamming Codes
Author
Abdel-Ghaffar, Khaled A S ; Weber, Jos H.
Author_Institution
Dept. of ECE, California Univ., Davis, CA
fYear
2006
fDate
9-14 July 2006
Firstpage
1544
Lastpage
1548
Abstract
In the 2004 Shannon Lecture, McEliece presented an expression for the number of stopping sets of size three for a full-rank parity-check matrix of the Hamming code. In this paper, we derive an expression for the number of stopping sets of any given size for the same parity-check matrix
Keywords
Hamming codes; matrix algebra; parity check codes; Hamming codes; full-rank parity-check matrices; stopping set enumerators; Block codes; Hamming distance; Helium; Iterative decoding; Null space; Parity check codes; Polynomials; USA Councils;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2006 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
1-4244-0505-X
Electronic_ISBN
1-4244-0504-1
Type
conf
DOI
10.1109/ISIT.2006.262127
Filename
4036226
Link To Document