Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes
From MaRDI portal
Publication:3549012
DOI10.1109/TIT.2007.903137zbMATH Open1325.94152arXivcs/0603007OpenAlexW2166168181MaRDI QIDQ3549012FDOQ3549012
Authors: Khaled Abdel-Ghaffar, J. H. Weber
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/cs/0603007
Recommendations
Cited In (6)
- The stopping distance of binary BCH-code parity-check matrices
- On the minimum stopping sets of product codes
- Stopping Sets of Hermitian Codes
- Small stopping sets in Steiner triple systems
- Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators
- 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)