Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Collaborative decoding of interleaved Reed-Solomon codes and concatenated code designs
IEEE Transactions on Information Theory
Decoding of interleaved Reed Solomon codes over noisy data
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Extended norm-trace codes with optimized correction capability
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Key equations for list decoding of Reed-Solomon codes and how to solve them
Journal of Symbolic Computation
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Efficient decoding of Reed-Solomon codes beyond half the minimum distance
IEEE Transactions on Information Theory
Reed-Solomon codes for correcting phased error bursts
IEEE Transactions on Information Theory
New List Decoding Algorithms for Reed–Solomon and BCH Codes
IEEE Transactions on Information Theory
A linear algebraic approach to multisequence shift-register synthesis
Problems of Information Transmission
Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
Designs, Codes and Cryptography
Fast skew-feedback shift-register synthesis
Designs, Codes and Cryptography
Decoding interleaved Reed---Solomon codes beyond their joint error-correcting capability
Designs, Codes and Cryptography
Hi-index | 754.84 |
In this paper, a new approach for decoding low-rate Reed-Solomon codes beyond half the minimum distance is considered and analyzed. The maximum error correcting radius coincides with the error correcting radius of the Sudan algorithm published in 1997. However, unlike the Sudan Algorithm, the approach described here is not a list decoding algorithm, and is not based on polynomial interpolation. The algorithm in this paper is rather syndrome based, like classical algebraic decoding algorithms. The computational complexity of the new algorithm is of the same order as the complexity of the well-known Berlekamp-Massey algorithm. To decode errors beyond half the minimum distance, the new decoder is allowed to fail for some high-weight error patterns with a very small probability.