On the Interpolation Step in the Guruswami-Sudan List Decoding Algorithm for Reed-Solomon Codes (2006)

by Peter Trifonov.

On the Interpolation Step in the Guruswami-Sudan List Decoding Algorithm for Reed-Solomon Codes

Divide-and-conquer method for interpolation in Guruswami-Sudan (GS) list decoding algorithm is considered. It is shown that the Groebner basis (GB) of the ideal of bivariate interpolation polynomials (IP) can be obtained as a product of trivariate polynomials corresponding to disjoint subsets of interpolation points. The impact of monomial ordering on the interpolation complexity is studied. [via]

http://dcn.infos.ru/~petert/papers/GSInterpol...