An iterative decoding scheme on random burst error correction with Reed-Solomon codes
AffiliationUniv Arizona, Dept Elect & Comp Engn
MetadataShow full item record
PublisherINDERSCIENCE ENTERPRISES LTD
CitationGao, X. (2018). An iterative decoding scheme on random burst error correction with Reed-Solomon codes. International Journal of Information and Coding Theory, 5(2), 117-129.
Rights© 2019 Inderscience Enterprises Ltd.
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at firstname.lastname@example.org.
AbstractWe investigate the decoding scheme of conventional Reed-Solomon (R-S) codes, and propose a systematic model to achieve better decoding results on random burst error corrections. We follow the iterative decoding procedure and verify this decoding model by implementing a typical R-S (15, 9) code, then present complexity analysis of this decoding model on the improvements for burst error correction. Simulations on several examples of R-S codes display the validity of this decoding scheme.
Note12 month embargo; available online: 24 Sep 2018
VersionFinal accepted manuscript