On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size

DOI10.1109/TIT.2006.888996MaRDI QIDQ3548292zbMATH OpenFDO

Authors Henk D. L. Hollmann, L. M. G. M. Tolhuizen

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/0507068

Mathematics Subject Classification ID

Decoding (94B35)

Abstract: Recently there has been interest in the construction of small parity check sets for iterative decoding of the Hamming code with the property that each uncorrectable (or stopping) set of size three is the support of a codeword and hence uncorrectable anyway. Here we reformulate and generalise the problem, and improve on this construction. First we show that a parity check collection that corrects all correctable erasure patterns of size m for the r-th order Hamming code (i.e, the Hamming code with codimension r) provides for all codes of codimension $r$ a corresponding ``generic parity check collection with this property. This leads naturally to a necessary and sufficient condition on such generic parity check collections. We use this condition to construct a generic parity check collection for codes of codimension r correcting all correctable erasure patterns of size at most m, for all r and m <= r, thus generalising the known construction for m=3. Then we discussoptimality of our construction and show that it can be improved for m>=3 and r large enough. Finally we discuss some directions for further research.

Recommendations

• On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
• Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
• Iterative Decoding of Linear Block Codes: A Parity-Check Orthogonalization Approach
• Erasure and error correcting ability of Parikh matrices
• Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound
• On error-and-erasure decoding of cyclic codes
• scientific article; zbMATH DE number 2081105
• List decoding from erasures: bounds and code constructions
• Iterative Decoding of LDPC Codes Over the <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math> </inline-formula>-Ary Partial Erasure Channel
• On Generic Erasure Correcting Sets and Related Problems

Cited in

(3)

• Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators
• On Generic Erasure Correcting Sets and Related Problems
• Generic erasure correcting sets: bounds and constructions

This page was built for publication: On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size

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