Title :
Linear-time binary codes correcting localized erasures
Author :
Barg, A. ; Zhou, S.
Author_Institution :
Lucent Technol., AT&T Bell Labs., Murray Hill, NJ, USA
Abstract :
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+ε) check bits, where t=αn is the maximal possible number of erasures and ε>0 is a constant. The complexity of encoding and decoding for both constructions depends linearly on n
Keywords :
binary codes; channel coding; computational complexity; decoding; error correction codes; linear codes; binary channel; channel coding; check bits; communication model; complexity; decoding; encoding; linear-time binary codes; localized erasures; n-bit transmission; Binary codes; Code standards; Decoding; Delay; Error correction codes; Propagation losses; Redundancy; Transmitters;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708799
