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 and O. De-taisne, Multistage list decoding of generalized reed-solomon codes over galois rings, IEEE Communications Letters, vol.9, issue.7, pp.625-627, 2005.
DOI : 10.1109/LCOMM.2005.1461685

N. Babu and K. Zimmermann, Decoding of linear codes over Galois rings Information Theory, IEEE Transactions on, vol.47, issue.4, pp.1599-1603, 2001.

D. Bleichenbacher, A. Kiayias, and M. Y. Automata, Decoding of Interleaved Reed Solomon Codes over Noisy Data, Languages and Programming, ser. Lecture Notes in Computer Science, vol.2719, pp.188-188, 2003.
DOI : 10.1007/3-540-45061-0_9

E. Byrne, Lifting Decoding Schemes over a Galois Ring, Applied Algebra, pp.323-332, 2001.
DOI : 10.1007/3-540-45624-4_34

D. Coppersmith and M. Sudan, Reconstructing curves in three (and higher) dimensional space from noisy data, Proceedings of the thirty-fifth ACM symposium on Theory of computing , STOC '03, pp.136-142, 2003.
DOI : 10.1145/780542.780563

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, pp.55-68, 2002.
DOI : 10.1007/978-1-4757-3789-9_5

P. Gopalan, V. Guruswami, and P. Raghavendra, List Decoding Tensor Products and Interleaved Codes, SIAM Journal on Computing, vol.40, issue.5, pp.1432-1462, 2011.
DOI : 10.1137/090778274
URL : http://arxiv.org/abs/0811.4395

M. Greferath and U. Vellbinger, Efficient decoding of Z/sub p/k-linear codes, IEEE Transactions on Information Theory, vol.44, issue.3, pp.1288-1291, 1998.
DOI : 10.1109/18.669412

V. Guruswami, List decoding of error-correcting codes: winning thesis of the 2002 ACM doctoral dissertation competition, ser. Lecture Notes in Computer Science, 2004.
DOI : 10.1007/b104335

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

J. Justesen, On the complexity of decoding Reed-Solomon codes (Corresp.), IEEE Transactions on Information Theory, vol.22, issue.2, pp.237-238, 1976.
DOI : 10.1109/TIT.1976.1055516

M. Lazard, Graduations, filtrations, valuations, Publications Mathématiques de L'IHÉSIH´IHÉS, pp.15-43, 1965.

R. Roth, Introduction to coding theory, 2006.
DOI : 10.1017/CBO9780511808968

M. Sudan, Decoding Reed-Solomon codes beyond the error-correction diameter, the 35th Annual Allerton Conference on Communication, Control and Computing, pp.215-224, 1997.

S. Wicker and V. Bhargava, Reed-Solomon Codes and Their Applications, 1999.
DOI : 10.1109/9780470546345