Efficient root-finding algorithm with application to list decoding of Algebraic-Geometric codes

@article{Wu2001EfficientRA,
  title={Efficient root-finding algorithm with application to list decoding of Algebraic-Geometric codes},
  author={Xin-Wen Wu and Paul H. Siegel},
  journal={IEEE Trans. Information Theory},
  year={2001},
  volume={47},
  pages={2579-2587}
}
A list decoding for an error-correcting code is a decoding algorithm that generates a list of codewords within a Hamming distance from the received vector, where can be greater than the error-correction bound. In [18], a list-decoding procedure for Reed–Solomon codes [19] was generalized to algebraic–geometric codes. A recent work [8] gives improved list… CONTINUE READING