An iterative decoding scheme on random burst error correction with Reed-Solomon codes

DOI10.1504/IJICOT.2018.095007MaRDI QIDQ1993393zbMATH OpenOpenAlexFDO

Authors Xin Gao

Publication date 5 November 2018

Published in International Journal of Information and Coding Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijicot.2018.095007

zbMATH Keywords

burst error correctiondecodingReed-Solomon (R-S) code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Burst-correcting codes (94B20) Decoding (94B35)

Review text

Summary: 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.

Recommendations

• Reed-solomon codes for correcting phased error bursts
• Random error and burst correction by iterated codes
• A modified RS decoding algorithm for burst error
• A burst-error-correcting algorithm for Reed-Solomon codes
• Novel Reed-Solomon hard-decision decoding algorithm study based on new hybrid channel model

Cited in

(5)

• Novel Reed-Solomon hard-decision decoding algorithm study based on new hybrid channel model
• Reed-solomon codes for correcting phased error bursts
• A burst-error-correcting algorithm for Reed-Solomon codes
• A modified RS decoding algorithm for burst error
• Random error and burst correction by iterated codes

This page was built for publication: An iterative decoding scheme on random burst error correction with Reed-Solomon codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1993393)