Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators
From MaRDI portal
Abstract: The performance of iterative decoding techniques for linear block codes correcting erasures depends very much on the sizes of the stopping sets associated with the underlying Tanner graph, or, equivalently, the parity-check matrix representing the code. In this paper, we introduce the notion of dead-end sets to explicitly demonstrate this dependency. The choice of the parity-check matrix entails a trade-off between performance and complexity. We give bounds on the complexity of iterative decoders achieving optimal performance in terms of the sizes of the underlying parity-check matrices. Further, we fully characterize codes for which the optimal stopping set enumerator equals the weight enumerator.
Recommendations
- Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes
- Stopping Set Distribution of LDPC Code Ensembles
- On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size
- On the stopping distance and the stopping redundancy of codes
- Stopping Set Analysis of Iterative Row-Column Decoding of Product Codes
Cited in
(6)- Effect of one redundant parity-check equation on the stopping distance
- Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes
- Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes
- 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”
- Decoding error probability of random parity-check matrix ensemble over the erasure channel
This page was built for publication: Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604706)
