M. 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

V. Guruswami and M. Sudan, Improved decoding of Reed-Solomon and algebraic-geometry codes Information Theory, IEEE Transactions on, vol.45, issue.6, pp.1757-1767, 1999.
DOI : 10.1109/18.782097
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.9671

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

R. Kötter and A. Vardy, Algebraic soft-decision decoding of Reed- Solomon codes Information Theory, IEEE Transactions on, vol.49, issue.11, pp.2809-2825, 2003.

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

V. Guruswami, List Decoding of Error-Correcting Codes -Winning Thesis of the 2002 ACM Doctoral Dissertation Competition, ser. Lectures Notes in Computer Science, 2004.

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

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

D. Augot, M. Barbier, and A. Couvreur, List-decoding of binary Goppa codes up to the binary Johnson bound, 2011 IEEE Information Theory Workshop
DOI : 10.1109/ITW.2011.6089384
URL : https://hal.archives-ouvertes.fr/inria-00547106

D. J. Bernstein, List Decoding for Binary Goppa Codes, 2008.
DOI : 10.1109/TIT.1976.1055610
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.2744

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

Y. Wu, New list decoding algorithms for Reed-Solomon and BCH codes Information Theory, IEEE Transactions on, vol.54, issue.8, pp.3611-3630, 2008.

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

H. Stichtenoth, Algebraic function fields and codes, 2009.

D. J. Bernstein, T. Lange, and C. Peters, Wild McEliece, Cryptology ePrint Archive Report, vol.34, 2010.
DOI : 10.1109/18.21264

D. Augot and L. Pecquet, A Hensel lifting to replace factorization in list decoding of algebraic-geometric and Reed-Solomon codes Information Theory, IEEE Transactions on, vol.46, issue.7, pp.2605-2613, 2000.

R. M. Roth and G. Ruckenstein, Efficient decoding of Reed-Solomon codes beyond half the minimum distance Information Theory, IEEE Transactions on, vol.46, issue.1, pp.246-257, 2000.

R. Kötter, On algebraic decoding of algebraic-geometric and cyclic codes, 1996.

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

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

D. J. Bernstein, Simplied high-speed high-distance list decoding for alternant codes, 2011.

M. Alekhnovich, Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes Information Theory, IEEE Transactions on, vol.51, issue.7, pp.2257-2265, 2005.
DOI : 10.1109/sfcs.2002.1181968

P. Beelen and K. Brander, Key equations for list decoding of Reed???Solomon codes and how to solve them, Journal of Symbolic Computation, vol.45, issue.7, pp.773-786, 2010.
DOI : 10.1016/j.jsc.2010.03.010