Please use this identifier to cite or link to this item:
|Title:||Decoding of Reed-Solomon codes for burst correction||Authors:||Krachkovsky, V.Y.||Issue Date:||2001||Citation:||Krachkovsky, V.Y. (2001). Decoding of Reed-Solomon codes for burst correction. IEEE International Symposium on Information Theory - Proceedings : 179-. ScholarBank@NUS Repository.||Abstract:||A new approach for multiple bursts correction by RS codes is considered. Based on the folded structure of 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.||Source Title:||IEEE International Symposium on Information Theory - Proceedings||URI:||http://scholarbank.nus.edu.sg/handle/10635/51132||ISSN:||21578095|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 5, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.