arXiv · math/0405082
On the List and Bounded Distance Decodibility of the Reed-Solomon Codes
Abstract
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.
Explore related subjects
Keep this discovery
Qi Cheng, Daqing Wan. 2004-05-05. On the List and Bounded Distance Decodibility of the Reed-Solomon Codes. https://arxiv.org/abs/math/0405082
Cite the original work for its findings. Save a collection to share your selection of sources.