Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes

Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The initialization step in the algorithm involves parameter choices that bound the degree of the interpolating polynomial and hence the length of the list of codewords generated. In this paper, we use simple properties of discriminants of polynomials over finite fields to provide improved parameter choices for the Guruswami-Sudan list decoding algorithm for algebraic geometry codes. As a consequence, we obtain a better bound on the list size as well as a lower degree interpolating polynomial.

• Type: Journal
• Year: 2010
• Where: DCC
• Authors: Nathan Drake, Gretchen L. Matthews
• Keywords: Algebraic Geometry Codes, Algorithm, Computer Graphics, DCC 2010, Polynomial