Title :
Low delay burst erasure correcting codes for packet transmission
Author :
Martinian, Emin ; Sundberg, Carl-Erik W.
Author_Institution :
EECS Dept., MIT, Cambridge, MA, USA
Abstract :
We present a bound relating the decoding delay, correctable burst length and rate of any erasure correcting code. Next we describe a new code construction which is optimal in the sense that the proposed codes have the shortest possible decoding delay allowed by our bound. These "maximally short" codes provide a useful tool to mitigate packet loss in delay sensitive applications.
Keywords :
Reed-Solomon codes; block codes; decoding; error correction codes; Reed-Solomon block code; burst erasure correcting codes; correctable burst length; decoding delay bound; maximally short codes; optimal code construction; packet loss; Block codes; Decoding; Delay; Interleaved codes; Internet telephony; Linearity; Parity check codes; Propagation losses; Protection; Reed-Solomon codes;
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
DOI :
10.1109/ISIT.2002.1023700
