About Some Numerical Experiments on a List Decoder
DOI:
https://doi.org/10.14529/ctcr170318Keywords:
algebraic coding, RS-code, GS-decoder, error-correcting capability, decodingAbstract
This paper deals with the fundamental possibility of implementing successful decoding of messages the number of errors in which a priori exceeds the pair's correcting ability (RS-code, GS-decoder), for some types of Reed-Solomon codes. To test the hypothesis of the existence of such a possibility, a model was constructed and a special algorithm based on the processing of erasures was developed, and computational experiments were carried out. The change in the average power of the output list of the GS decoder using this algorithm was also analyzed. It is shown that with the use of the proposed algorithm the frequency of successful decoding increases, while there is no statistically significant change in the average power of the output list.
References
Sudan, M. Decoding of Reed Solomon codes beyond the error correction bound / M. Sudan // J. Compl. – 1997. – Vol. 13. – P. 180–193.
Guruswami, V. Improved decoding of Reed-Solomon and algebraic-geometry codes / V. Guruswami, M. Sudan // IEEE Transactions on Information Theory. – 1999, September. – Vol. 45. – P. 1757–1767. DOI: 10.1109/18.782097
Sudan, M. Lectures «Algorithmic Introduction to Coding Theory» / M. Sudan. – 2001.
McEliece, R.J. The Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes / R.J. McEliece // IPN Progress Report 42-153. – May 15, 2003. – P. 1–60.
