Generating parity check equations for bounded-distance iterative erasure decoding

A generic (r,m)-erasure correcting set is a collection of vectors in F 2 r which can be used to generate, for each binary linear code of codimension r, a collection of parity check equations that enables iterative decoding of all correctable erasure patterns of size at most m. That is to say, the only stopping sets of size at most m for the generated parity check equations are the erasure patterns for which there is more than one manner to fill in the erasures to obtain a codeword. We give an explicit construction of generic (r,m)-erasure correcting sets of cardinality Sigma i=0 m-1 ( i r-1 ). Using a random-coding-like argument, we show that for fixed m, the minimum size of a generic (r,m)-erasure correcting set is linear in r