By Topic

On Generic Erasure Correcting Sets and Related Problems

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
$31 $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)
Ahlswede, R. ; Dept. of Math., Univ. of Bielefeld, Bielefeld, Germany ; Aydinian, H.

Motivated by iterative decoding techniques for the binary erasure channel Hollmann and Tolhuizen introduced and studied the notion of generic erasure correcting sets for linear codes. A generic (r,s)-erasure correcting set generates for all codes of codimension r a parity check matrix that allows iterative decoding of all correctable erasure patterns of size s or less. The problem is to derive bounds on the minimum size F(r,s) of generic erasure correcting sets and to find constructions for such sets. In this paper, we continue the study of these sets. We derive better lower and upper bounds. Hollmann and Tolhuizen also introduced the stronger notion of (r,s)-sets and derived bounds for their minimum size G(r,s) . Here also we improve these bounds. We observe that these two conceps are closely related to so called s -wise intersecting codes, an area, in which G(r,s) has been studied primarily with respect to ratewise performance. We derive connections. Finally, we observed that hypergraph covering can be used for both problems to derive good upper bounds.

Published in:

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