Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Bounded distance+1 soft-decision Reed-Solomon decoding
IEEE Transactions on Information Theory
Complementary reliability-based decodings of binary linear block codes
IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Hi-index | 0.00 |
This paper presents a hybrid chase-like algorithm for Reed-Solomon (RS) codes, which is based on list decoding algorithm. The main idea of this paper is to apply chase-like algorithm to change the input to the interpolation step of list algorithm based on the bit reliability. Simulation results show that the performance of hybrid algorithm for (7,5) RS code can approach the one of maximum likelihood decoding, and the performance of (15,7) RS code can correct one more symbol errors than list decoding algorithm.