2004/05/05 by Cheng, Qi, Wan, Daqing
#11Y16 #68Q25 #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Number Theory (math.NT)
paper · doi:10.48550/arxiv.math/0405082
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.