Sciweavers

Share
ESA
2000
Springer

On Representations of Algebraic-Geometric Codes for List Decoding

8 years 7 months ago
On Representations of Algebraic-Geometric Codes for List Decoding
Abstract. 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.
Venkatesan Guruswami, Madhu Sudan
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where ESA
Authors Venkatesan Guruswami, Madhu Sudan
Comments (0)
books