Performance Analysis of Algebraic Soft-Decision Decoding of Reed–Solomon Codes
- 21 October 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 54 (11) , 5012-5018
- https://doi.org/10.1109/tit.2008.929969
Abstract
We investigate the decoding region for algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes in a discrete, memoryless, additive-noise channel. An expression is derived for the error correction radius within which the soft-decision decoder produces a list that contains the transmitted codeword. The error radius for ASD is shown to be larger than that of Guruswami-Sudan (GS) hard-decision decoding for a subset of low and medium-rate codes. These results are also extended to multivariable interpolation in the sense of Parvaresh and Vardy.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Applications of algebraic soft-decision decoding of Reed-Solomon codesIEEE Transactions on Communications, 2006
- On optimal weight assignmnents for multivariate interpolation list-decodingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial TimePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Performance analysis of algebraic soft decoding of reed-solomon codes over binary symmetric and erasure channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Soft-decision decoding of RS codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Algebraic soft-decision decoding of reed-solomon codesIEEE Transactions on Information Theory, 2003
- Multiplicity assignments for algebraic soft-decoding of reed-solomon codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999