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.