Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes
<|reference_start|>Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes: In this paper, we present an iterative soft-decision decoding algorithm for Reed-Solomon codes offering both complexity and performance advantages over previously known decoding algorithms. Our algorithm is a list decoding algorithm which combines two powerful soft decision decoding techniques which were previously regarded in the literature as competitive, namely, the Koetter-Vardy algebraic soft-decision decoding algorithm and belief-propagation based on adaptive parity check matrices, recently proposed by Jiang and Narayanan. Building on the Jiang-Narayanan algorithm, we present a belief-propagation based algorithm with a significant reduction in computational complexity. We introduce the concept of using a belief-propagation based decoder to enhance the soft-input information prior to decoding with an algebraic soft-decision decoder. Our algorithm can also be viewed as an interpolation multiplicity assignment scheme for algebraic soft-decision decoding of Reed-Solomon codes.<|reference_end|>
@article{el-khamy2005iterative,
    title={Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes},
    author={Mostafa El-Khamy and Robert J. McEliece},
    journal={IEEE Journal on Selected Areas in Communications, Volume 24, Issue
  3, March 2006 Page(s):481 - 490},
    year={2005},
    doi={10.1109/JSAC.2005.862399},
    archivePrefix={arXiv},
    eprint={cs/0509097},
    primaryClass={cs.IT math.IT}
}