Performance analysis of algebraic soft decoding of reed-solomon codes over binary symmetric and erasure channels
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1186-1190
- https://doi.org/10.1109/isit.2005.1523529
Abstract
In this paper, we characterize the decoding region of algebraic soft decoding (ASD) [4] of Reed-Solomon (RS) codes over erasure channels and binary symmetric channel (BSC). Optimal multiplicity assignment strategies (MAS) are investigated and tight bounds are derived to show the ASD can significantly outperform conventional Berlekamp Massey (BM) decoding over these channels for a wide code rate range. The analysis technique can also be extended to other channel models, e.g., RS coded modulation over erasure channelsKeywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Exponential error bounds for algebraic soft-decision decoding of reed solomon codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Algebraic soft-decision decoding of reed-solomon codesIEEE Transactions on Information Theory, 2003
- Decoding of Reed-Solomon codes for additive cost functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An average weight-distance enumerator for binary expansions of Reed-Solomon codesIEEE Transactions on Information Theory, 2002
- Trellis codes for periodic erasuresIEEE Transactions on Communications, 2000
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999