On the List and Bounded Distance Decodibility of the Reed-Solomon Codes
Number Theory
2007-07-16 v1 Information Theory
math.IT
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.
Keywords
Cite
@article{arxiv.math/0405082,
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 = {2007}
}