An iterative decoding scheme on random burst error correction with Reed-Solomon codes (Q1993393)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6973118
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative decoding scheme on random burst error correction with Reed-Solomon codes |
scientific article; zbMATH DE number 6973118 |
Statements
An iterative decoding scheme on random burst error correction with Reed-Solomon codes (English)
0 references
5 November 2018
0 references
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.
0 references
Reed-Solomon (R-S) code
0 references
burst error correction
0 references
decoding
0 references
0.8244660496711731
0 references
0.8141017556190491
0 references
0.8046851754188538
0 references
0.7934142351150513
0 references
0.7882086038589478
0 references
