DocumentCode
2024580
Title
Delay-Optimal Burst Erasure Code Construction
Author
Martinian, E. ; Trott, M.
Author_Institution
Tilda Consulting Inc., Arlington, MA
fYear
2007
fDate
24-29 June 2007
Firstpage
1006
Lastpage
1010
Abstract
Delay-optimal burst erasure correction codes have the shortest possible decoding delay required to correct all bursts of a given length with a fixed redundancy. We provide a simple construction that yields linear convolutional delay-optimal burst erasure codes for any choice of coding parameters while keeping the finite field small.
Keywords
convolutional codes; decoding; error correction codes; coding parameters; delay decoding; delay-optimal burst erasure correction code construction; finite fields; linear convolutional codes; Convolutional codes; Decoding; Delay lines; Galois fields; Internet; Joining processes; Laboratories; Legged locomotion; Milling machines; Streaming media;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location
Nice
Print_ISBN
978-1-4244-1397-3
Type
conf
DOI
10.1109/ISIT.2007.4557355
Filename
4557355
Link To Document