Abstract
We 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.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Information and Coding Theory
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
