By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Henk D. L. Hollmann ; Philips Res. Labs., Eindhoven ; Ludo M. G. M. Tolhuizen

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 generalize the problem and improve on this construction. We show that a parity-check collection that corrects all correctable erasure patterns of size m for the Hamming code with codimension r provides, in fact, for all codes of codimension r a corresponding "generic" parity-check collection with this property. This leads in a natural way to a necessary and sufficient condition for 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 mlesr, thus generalizing the known construction for m=3. Then we discuss optimality of our construction and show that it can be improved for mges3 and r large enough. Finally, we discuss some directions for further research

Published in:

IEEE Transactions on Information Theory  (Volume:53 ,  Issue: 2 )