On the List and Bounded Distance Decodibility of the Reed-Solomon Codes
<|reference_start|>On the List and Bounded Distance Decodibility of the Reed-Solomon Codes: In this paper show that the list and bounded-distance decoding problems of certain bounds for the Reed-Solomon code are at least as hard as the discrete logarithm problem over finite fields.<|reference_end|>
@article{cheng2004on,
    title={On the List and Bounded Distance Decodibility of the Reed-Solomon Codes},
    author={Qi Cheng and Daqing Wan},
    journal={arXiv preprint arXiv:math/0405082},
    year={2004},
    archivePrefix={arXiv},
    eprint={math/0405082},
    primaryClass={math.NT cs.IT math.IT}
}