Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes

DOI10.1109/TIT.2007.903137MaRDI QIDQ3549012zbMATH OpenOpenAlexFDO

Authors Khaled Abdel-Ghaffar, J. H. Weber

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0603007

zbMATH Keywords

Hamming codelinear codeparity-check matrixstopping set enumeratorweight enumerator

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Abstract: Stopping sets, and in particular their numbers and sizes, play an important role in determining the performance of iterative decoders of linear codes over binary erasure channels. 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 correspondence, we derive an expression for the number of stopping sets of any given size for the same parity-check matrix.

Recommendations

• Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators
• On the stopping distance and the stopping redundancy of codes
• Stopping Set Distribution of LDPC Code Ensembles
• On the minimum stopping sets of product codes
• Two classes of optimal stopping redundancy codes.

Cited in

(6)

• Small stopping sets in Steiner triple systems
• The stopping distance of binary BCH-code parity-check matrices
• Stopping Sets of Hermitian Codes
• Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators
• On the minimum stopping sets of product codes
• Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices”

This page was built for publication: Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549012)