On Representations of Algebraic-Geometric Codes for List Decoding

We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15,7] to run in polynomial time. We do this by presenting a root-finding algorithm for univariate polynomials over function fields when their coefficients lie in finite-dimensional linear spaces, and proving that there is a polynomial size representation given which the root finding algorithm runs in polynomial time.

[1]  E. Berlekamp Factoring polynomials over large finite fields* , 1971, SYMSAC '71.

[2]  Peter Elias,et al.  List decoding for noisy channels , 1957 .

[3]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[4]  Daniel Augot,et al.  A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes , 2000, IEEE Trans. Inf. Theory.

[5]  Henning Stichtenoth,et al.  Algebraic function fields over finite fields with many rational places , 1995, IEEE Trans. Inf. Theory.

[6]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[7]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[8]  Shuhong Gao,et al.  Computing Roots of Polynomials over Function Fields of Curves , 1999 .

[9]  Vladimir M. Blinovsky,et al.  List decoding , 1992, Discrete Mathematics.

[10]  Venkatesan Guruswami,et al.  List decoding algorithms for certain concatenated codes , 2000, STOC '00.

[11]  Tom Høholdt,et al.  Decoding Hermitian Codes with Sudan's Algorithm , 1999, AAECC.

[12]  Henning Stichtenoth,et al.  Algebraic function fields and codes , 1993, Universitext.

[13]  Tom Høholdt,et al.  Decoding Reed-Solomon Codes Beyond Half the Minimum Distance , 2000 .

[14]  Amin Shokrollahi,et al.  List Decoding of Algebraic-Geometric Codes , 1999, IEEE Trans. Inf. Theory.

[15]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[16]  Moni Naor,et al.  The hardness of decoding linear codes with preprocessing , 1990, IEEE Trans. Inf. Theory.