M. Alekhnovich, Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed???Solomon Codes, IEEE Transactions on Information Theory, vol.51, issue.7, pp.2257-2265, 2005.
DOI : 10.1109/TIT.2005.850097

M. A. Armand, Improved list decoding of generalized reed-solomon and alternant codes over rings, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., p.384, 2004.
DOI : 10.1109/ISIT.2004.1365421

M. A. Armand, List Decoding of Generalized Reed???Solomon Codes Over Commutative Rings, IEEE Transactions on Information Theory, vol.51, issue.1, pp.411-419, 2005.
DOI : 10.1109/TIT.2004.839546

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

D. Augot and A. Zeh, On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm, 2008 IEEE International Symposium on Information Theory, pp.2620-2624, 2008.
DOI : 10.1109/ISIT.2008.4595466
URL : https://hal.archives-ouvertes.fr/inria-00509209

K. G. Bartley, Decoding algorithms for algebraic geometric codes over rings, 2006.

E. R. Berlekamp, Algebraic coding theory. M-6, 1984.

E. R. Berlekamp and L. R. Welch, Error correction for algebraic block codes, 1986.

J. Berthomieu, J. Van-der-hoeven, and G. Lecerf, Relaxed algorithms for p-adic numbers, Journal de Th??orie des Nombres de Bordeaux, vol.23, issue.3, 2011.
DOI : 10.5802/jtnb.777
URL : https://hal.archives-ouvertes.fr/hal-00486680

D. Bini and V. Y. Pan, Polynomial and matrix computations Fundamental algorithms, Progress in Theoretical Computer Science. Birkhäuser, 1994.

A. Bostan and ´. E. Schost, Polynomial evaluation and interpolation on special sets of points, Journal of Complexity, vol.21, issue.4, pp.420-446, 2005.
DOI : 10.1016/j.jco.2004.09.009

D. G. Cantor and E. Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.7, issue.7, pp.693-701, 1991.
DOI : 10.1007/BF01178683

D. V. Chudnovsky and G. V. Chudnovsky, On expansion of algebraic functions in power and Puiseux series, I, Journal of Complexity, vol.2, issue.4, pp.271-294, 1986.
DOI : 10.1016/0885-064X(86)90006-3

D. V. Chudnovsky and G. V. Chudnovsky, On expansion of algebraic functions in power and Puiseux series, II, Journal of Complexity, vol.3, issue.1, pp.1-25, 1987.
DOI : 10.1016/0885-064X(87)90002-1

I. S. Cohen, On the structure and ideal theory of complete local rings, Transactions of the American Mathematical Society, vol.59, issue.1, pp.54-106, 1946.
DOI : 10.1090/S0002-9947-1946-0016094-3

D. Duval, Rational Puiseux expansions, Compositio Math, vol.70, issue.2, pp.119-154, 1989.

A. Fröhlich and J. C. Shepherdson, Effective Procedures in Field Theory, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.248, issue.950, pp.407-432, 1956.
DOI : 10.1098/rsta.1956.0003

M. Fürer, Faster integer multiplication, Proceedings of the Thirty-Ninth ACM Symposium on Theory of Computing, pp.57-66, 2007.

S. Gao, A New Algorithm for Decoding Reed-Solomon Codes, Communications, Information and Network Security, pp.55-68, 2003.
DOI : 10.1007/978-1-4757-3789-9_5

S. Gao and M. A. Shrokrollahi, Computing roots of polynomials over function fields of curves Coding theory and cryptography: from enigma and Geheimschreiber to quantum theory, pp.214-228, 2000.

J. Zur-gathen, Hensel and Newton methods in valuation rings, Mathematics of Computation, vol.42, issue.166, pp.637-661, 1984.
DOI : 10.1090/S0025-5718-1984-0736459-9

J. Zur-gathen and J. Gerhard, Modern computer algebra, second edn, 2003.

P. Gaudry and E. Thomé, MPFQ, a finite field library, 2008.

T. Granlund, GMP, the GNU multiple precision arithmetic library, 1991.

D. Griffiths, Series Expansions of Algebraic Functions, Computational Algebra and Number Theory, Mathematics and Its Applications, pp.267-277, 1995.
DOI : 10.1007/978-94-017-1108-1_19

V. Guruswami and M. Sudan, Improved decoding of Reed-Solomon and algebraic-geometric codes, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.1757-1767, 1998.
DOI : 10.1109/SFCS.1998.743426

´. E. Hallouin, Computing Local Integral Closures, Journal of Symbolic Computation, vol.32, issue.3, pp.211-230, 2001.
DOI : 10.1006/jsco.2001.0447

J. P. Henry and M. Merle, Complexity of computation of embedded resolution of algebraic curves, Proceedings of Eurocal 87, pp.381-390, 1987.
DOI : 10.1007/3-540-51517-8_143

M. Iwami, Extension of expansion base algorithm for multivariate analytic factorization including the case of singular leading coefficient, ACM SIGSAM Bulletin, vol.39, issue.4, pp.122-126, 2005.
DOI : 10.1145/1140378.1140383

K. S. Kedlaya, The algebraic closure of the power series field in positive characteristic, Proc. Amer, pp.3461-3470, 2001.

R. Kötter, On algebraic decoding of algebraic-geometric and cycling 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

T. C. Kuo, Generalized Newton-Puiseux theory and Hensel's lemma in ${f C}[![x,y]!]$, Journal canadien de math??matiques, vol.41, issue.6, pp.1101-1116, 1989.
DOI : 10.4153/CJM-1989-048-7

G. Lecerf, Fast separable factorization and applications, Applicable Algebra in Engineering, Communication and Computing, vol.102, issue.1, pp.135-160, 2008.
DOI : 10.1007/s00200-008-0062-4
URL : https://hal.archives-ouvertes.fr/hal-00681420

T. K. Moon, Error correction coding: mathematical methods and algorithms, 2005.
DOI : 10.1002/0471739219

A. Poteaux and M. Rybowicz, Complexity bounds for the rational Newton-Puiseux algorithm over finite fields, Applicable Algebra in Engineering, Communication and Computing, vol.69, issue.1???2, pp.187-217, 2011.
DOI : 10.1007/s00200-011-0144-6
URL : https://hal.archives-ouvertes.fr/hal-00601438

R. Raghavendran, Finite associative rings, Compositio Math, vol.21, pp.195-229, 1969.

R. Nielsen, R. Høholdt, and T. , Decoding Reed-Solomon Codes Beyond Half the Minimum Distance, Coding Theory, Cryptography and Related Areas, pp.221-236, 2000.
DOI : 10.1007/978-3-642-57189-3_20

R. M. Roth and G. Ruckenstein, Efficient decoding of Reed-Solomon codes beyond half the minimum distance, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), p.56, 1998.
DOI : 10.1109/ISIT.1998.708637

A. Schönhage and V. Strassen, Fast multiplication of large numbers, Computing, vol.150, issue.3-4, pp.281-292, 1971.
DOI : 10.1007/BF02242355

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

T. K. Truong, W. L. Eastman, I. S. Reed, and I. S. Hsu, Simplified procedure for correcting both errors and erasures of Reed-Solomon code using Euclidean algorithm, IEE Proceedings E Computers and Digital Techniques, vol.135, issue.6, pp.318-324, 1988.
DOI : 10.1049/ip-e.1988.0043

J. L. Walker, Algebraic geometric codes over rings, Journal of Pure and Applied Algebra, vol.144, issue.1, pp.91-110, 1999.
DOI : 10.1016/S0022-4049(98)00047-4

R. J. Walker and P. G. Walsh, Algebraic curves Reprint of the 1950 edition 47 On the complexity of rational Puiseux expansions, Pacific J. Math, vol.188, issue.2, pp.369-387, 1978.

P. G. Walsh, A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function, Mathematics of Computation, vol.69, issue.231, pp.1167-1182, 2000.
DOI : 10.1090/S0025-5718-00-01246-1