Parameter choices on Guruswami–Sudan algorithm for polynomial reconstruction

Guruswami–Sudan algorithm for polynomial reconstruction problem plays an important role in the study of error-correcting codes. In this paper, we study new better parameter choices in Guruswami–Sudan algorithm for the polynomial reconstruction problem. As a consequence, our result gives a better upper bound for the number of solutions for the polynomial reconstruction problem comparing with the original algorithm.