M. Alekhnovich, Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed?Solomon Codes, IEEE Trans. Inform. Theory, vol.51, issue.7, 2005.

L. A. Bassalygo, New upper bounds for error-correcting codes, Probl. Inf. Transm, vol.1, issue.4, pp.41-44, 1965.

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

P. Beelen, T. Høholdt, J. S. Nielsen, and Y. Wu, On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes, IEEE Transactions on Information Theory, vol.59, issue.6, pp.3269-3281, 2013.
DOI : 10.1109/TIT.2013.2243800
URL : http://arxiv.org/abs/1211.0122

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

K. Brander, Interpolation and List Decoding of Algebraic Codes, 2010.

Y. Cassuto, J. Bruck, and R. Mceliece, On the Average Complexity of Reed–Solomon List Decoders, IEEE Transactions on Information Theory, vol.59, issue.4, pp.2336-2351, 2013.
DOI : 10.1109/TIT.2012.2235522

M. F. Chowdhury, C. P. Jeannerod, V. Neiger, E. Schost, and G. Villard, Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations, IEEE Transactions on Information Theory, vol.61, issue.5, 2014.
DOI : 10.1109/TIT.2015.2416068
URL : https://hal.archives-ouvertes.fr/hal-00941435

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 2003.
DOI : 10.1017/CBO9781139856065

P. Giorgi, C. Jeannerod, and G. Villard, On the complexity of polynomial matrix computations, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, pp.135-142, 2003.
DOI : 10.1145/860854.860889

V. Guruswami and M. 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

S. M. Johnson, A new upper bound for error-correcting codes, IEEE Transactions on Information Theory, vol.8, issue.3, pp.203-207, 1962.
DOI : 10.1109/TIT.1962.1057714

R. Kötter, 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, pp.633-647, 2011.
DOI : 10.1109/TIT.2010.2096034

R. Kötter and A. Vardy, A complexity reducing transformation in algebraic list decoding of Reed-Solomon codes, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674), pp.10-13, 2003.
DOI : 10.1109/ITW.2003.1216682

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

K. Lee and M. E. O-'sullivan, List decoding of Reed???Solomon codes from a Gr??bner basis perspective, Journal of Symbolic Computation, vol.43, issue.9, pp.645-658, 2008.
DOI : 10.1016/j.jsc.2008.01.002

A. Lenstra, Factoring multivariate polynomials over finite fields, Journal of Computer and System Sciences, vol.30, issue.2, pp.235-248, 1985.
DOI : 10.1016/0022-0000(85)90016-9

T. Mulders and A. Storjohann, On lattice reduction for polynomial matrices, Journal of Symbolic Computation, vol.35, issue.4, pp.377-401, 2003.
DOI : 10.1016/S0747-7171(02)00139-6

J. S. Nielsen, List decoding of algebraic codes, 2013.

J. S. Nielsen and A. Zeh, Multi-trial Guruswami???Sudan decoding for generalised Reed???Solomon codes, Designs, Codes and Cryptography, vol.73, issue.2, 2013.
DOI : 10.1007/s10623-014-9951-7
URL : https://hal.archives-ouvertes.fr/hal-00975927

R. Roth and G. 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

W. Stein, Version 5.13, Release Date: 2013-12-15). The Sage Development Team, Sage Mathematics Software, 2013.

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

S. Tang, L. Chen, and X. Ma, Progressive List-Enlarged Algebraic Soft Decoding of Reed-Solomon Codes, IEEE Communications Letters, vol.16, issue.6, pp.901-904, 2012.
DOI : 10.1109/LCOMM.2012.042512.112511

A. Zeh, C. Gentner, and D. Augot, An Interpolation Procedure for List Decoding Reed–Solomon Codes Based on Generalized Key Equations, IEEE Transactions on Information Theory, vol.57, issue.9, pp.5946-5959, 2011.
DOI : 10.1109/TIT.2011.2162160