Stopping Set Enumerators of Full-Rank Parity-Check Matrices of Hamming Codes
Khaled Abdel-Ghaffar, Jos H. Weber · 2006
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