DocumentCode
2516389
Title
Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures
Author
Hollmann, Henk D L ; Tolhuizen, Ludo M G M
Author_Institution
Philips Res., Eindhoven
fYear
2008
fDate
6-11 July 2008
Firstpage
1050
Lastpage
1052
Abstract
We give recursive constructions, valid for any field, of [n,k] codes capable of correcting a (wrap-around) burst of n - k erasures.
Keywords
error correction codes; minimum-redundancy codes; recursive constructions; Decoding; Delay; Equations; Galois fields; Legged locomotion; Linear code; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location
Toronto, ON
Print_ISBN
978-1-4244-2256-2
Electronic_ISBN
978-1-4244-2257-9
Type
conf
DOI
10.1109/ISIT.2008.4595147
Filename
4595147
Link To Document