Linear-time binary codes correcting localized erasures

We consider a communication model over a binary channel in which the transmitter knows which bits of the n-bit transmission are prone to loss in the channel. We present two constructions of binary codes with t(1+/spl epsi/) check bits, where t=/spl alpha/n is the maximal possible number of erasures and /spl epsi/>0 is a constant. The complexity of encoding and decoding for both constructions depends linearly on n.