D. Augot and L. Pecquet, A Hensel lifting to replace factorization in list decoding of algebraic-geometric and Reed-Solomon codes, IEEE Transactions on Information Theory, vol.46, issue.7, pp.2605-2613, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00509339

E. R. Berlekamp, Algebraic coding theory, 1968.
DOI : 10.1142/9407

E. R. Berlekamp, Algebraic Coding Theory, Revised 1984 Edition, 1984.

. Ber08, J. Daniel, and . Bernstein, List decoding for binary Goppa codes, 2008.

D. Cox, J. Little, and D. Shea, Ideals, Varieties and Algorithms, 1992.

P. Elias, Error-correcting codes for list decoding, IEEE Transactions on Information Theory, vol.37, issue.1, pp.5-12, 1991.
DOI : 10.1109/18.61123

W. Fulton, Algebraic curves Advanced Book Classics, 1989.

M. [. Guruswami and . Sudan, Improved decoding of Reed-Solomon and algebraic-geometry codes, IEEE Transactions on Information Theory, vol.45, issue.6, pp.1757-1767, 1999.
DOI : 10.1109/18.782097

[. Guruswami, List Decoding of Error-Correcting Codes - Winning Thesis of the, ACM Doctoral Dissertation Competition Lectures Notes in Computer Science, vol.3282, 2002.

[. Guruswami, Algorithmic Results in List Decoding, Foundations and Trends?? in Theoretical Computer Science, vol.2, issue.2, 2007.
DOI : 10.1561/0400000007

R. Koetter, J. Ma, and A. Vardy, The Re-Encoding Transformation in Algebraic List-Decoding of Reed–Solomon Codes, IEEE Transactions on Information Theory, vol.57, issue.2, 2010.
DOI : 10.1109/TIT.2010.2096034

R. Kötter, On Algebraic Decoding of Algebraic-Geometric and Cyclic Codes, 1996.

R. Kötter and A. Vardy, Algebraic soft-decision decoding of reed-solomon codes, IEEE Transactions on Information Theory, vol.49, issue.11, pp.2809-2825, 2003.
DOI : 10.1109/TIT.2003.819332

H. , M. Möller, and B. Buchberger, The construction of multivariate polynomials with preassigned zeros, Proceedings of the European Computer Algebra Conference on Computer Algebra, EU- ROCAM'82, pp.24-31, 1982.

N. [. Macwilliams and . Sloane, The Theory of Error- Correcting Codes. North-Holland Mathematical Library, 1983.

]. N. Pat75 and . Patterson, The algebraic decoding of Goppa codes, IEEE Transactions on Information Theory, vol.21, issue.2, pp.203-207, 1975.

R. Roth, Introduction to Coding Theory, 2006.
DOI : 10.1017/CBO9780511808968

G. [. Roth and . Ruckenstein, Efficient decoding of Reed-Solomon codes beyond half the minimum distance, IEEE Transactions on Information Theory, vol.46, issue.1, pp.246-257, 2000.
DOI : 10.1109/18.817522

[. Stichtenoth, Algebraic function fields and codes. Universitext, 1993.

[. Sudan, Decoding of Reed Solomon Codes beyond the Error-Correction Bound, Journal of Complexity, vol.13, issue.1, pp.180-193, 1997.
DOI : 10.1006/jcom.1997.0439

I. Tal and R. M. Roth, On list decoding of alternant codes in the Hamming and Lee metrics, Proceedings of IEEE International Symposium on Information Theory, p.364, 2003.

V. Peter and . Trifonov, Efficient Interpolation in the Guruswami-Sudan Algorithm, IEEE Transactions on Information Theory, vol.56, issue.9, pp.4341-4349, 2010.

A. Vardy and R. Koetter, Algebraic Soft-Decision Decoding of Reed-Solomon Codes. 53 pages, 2000.

S. Vl?, D. Nogin, and M. Tsfasman, Algebraic Geometric Codes: Basic Notions, 2007.

Y. Wu, New List Decoding Algorithms for Reed–Solomon and BCH Codes, IEEE Transactions on Information Theory, vol.54, issue.8, pp.3611-3630, 2008.
DOI : 10.1109/TIT.2008.926355