I. Introduction
In 1997, Sudan presented the first list-decoding algorithm for Reed-Solomon codes [1]. Since the correction radius of Sudan's algorithm is larger, this represented an important milestone in algorithmic list-decoding Afterwards, Guruswami and Sudan [2] improved the previous algorithm by adding the notion of multiplicities. The number of errors that this algorithm is able to list-decode corresponds to the Johnson radius , where is the minimum distance of the code.