DocumentCode
3276687
Title
Decoding of Reed-Solomon codes for burst correction
Author
Krachkovsky, Victor Y.
Author_Institution
ECE Dept., Nat. Univ. of Singapore, Singapore
fYear
2001
fDate
2001
Firstpage
179
Abstract
A new approach for multiple bursts correction by RS codes is considered. Based on the folded structure of an RS code, it helps to achieve near-optimal burst correction capability, apart from the random error correction. We show that all correctable bursts can be recovered by applying the multi-sequence shift-register synthesis algorithm
Keywords
Reed-Solomon codes; binary sequences; decoding; error correction codes; RS codes; Reed-Solomon codes; correctable bursts; folded structure; multi-sequence shift-register synthesis algorithm; multiple bursts correction; near-optimal burst correction capability; random error correction; Decoding; Equations; Error correction codes; Iterative algorithms; Linear feedback shift registers; Memory; Polynomials; Reed-Solomon codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location
Washington, DC
Print_ISBN
0-7803-7123-2
Type
conf
DOI
10.1109/ISIT.2001.936042
Filename
936042
Link To Document