A. V. Aho and J. E. Hopcroft, The Design and Analysis of Computer Algorithms, 1974.

R. E. Blahut, Fast Algorithms for Digital Signal Processing, 1985.

D. Bleichenbacher, A. Kiayias, and M. Yung, Decoding interleaved Reed???Solomon codes over noisy channels, Theoretical Computer Science, vol.379, issue.3, pp.348-360, 2007.
DOI : 10.1016/j.tcs.2007.02.043
URL : http://doi.org/10.1016/j.tcs.2007.02.043

G. L. Feng and K. K. Tzeng, A generalized Euclidean algorithm for multisequence shift-register synthesis, IEEE Transactions on Information Theory, vol.35, issue.3, pp.35-584, 1989.
DOI : 10.1109/18.30981

G. L. Feng and K. K. Tzeng, A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes, IEEE Transactions on Information Theory, vol.37, issue.5, pp.37-1274, 1991.
DOI : 10.1109/18.133246

J. Gathen and J. Gerhard, Modern Computer Algebra, 2003.

C. Hartmann, Decoding beyond the BCH bound (Corresp.), IEEE Transactions on Information Theory, vol.18, issue.3, pp.441-444, 1972.
DOI : 10.1109/TIT.1972.1054824

V. Y. Krachkovsky, Reed-solomon codes for correcting phased error bursts, IEEE Transactions on Information Theory, vol.49, issue.11, pp.49-2975, 2003.
DOI : 10.1109/TIT.2003.819333

V. Y. Krachkovsky and Y. X. Lee, Decoding for iterative Reed-Solomon coding schemes, IEEE Transactions on Magnetics, vol.33, issue.5, pp.2740-2742, 1997.
DOI : 10.1109/20.617715

J. D. Lipson, Elements of Algebra and Algebraic Computing, 1981.

C. Roos, A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound, Journal of Combinatorial Theory, Series A, vol.33, issue.2, pp.33-229, 1982.
DOI : 10.1016/0097-3165(82)90014-0

G. Schmidt, V. R. Sidorenko, and M. Bossert, Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis, IEEE Transactions on Information Theory, vol.56, issue.10, pp.56-5245, 2010.
DOI : 10.1109/TIT.2010.2060130

Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, A method for solving key equation for decoding goppa codes, Information and Control, vol.27, issue.1, pp.27-87, 1975.
DOI : 10.1016/S0019-9958(75)90090-X

L. Wang, Euclidean modules and multisequence synthesis Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp.239-248, 2001.

A. Zeh and W. Li, Decoding Reed-Solomon codes up to the Sudan radius with the Euclidean algorithm, 2010 International Symposium On Information Theory & Its Applications, pp.986-990, 2010.
DOI : 10.1109/ISITA.2010.5649520
URL : https://hal.archives-ouvertes.fr/hal-00647597