M. Sudan, Decoding of Reed Solomon Codes beyond the Error-Correction Bound, Journal of Complexity, vol.13, issue.1, pp.180-1930439, 1997.
DOI : 10.1006/jcom.1997.0439

V. Guruswami, M. Sudan3j, R. M. Roth, and G. Ruckenstein, 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

G. Ruckenstein, Error decoding strategies for algebraic codes Available, 2001.

D. Augot and A. Zeh, On the Roth and Ruckenstein Equations for the Guruswami-Sudan Algorithm," in Information Theory, IEEE International Symposium on, pp.2620-26244595466, 2008.

G. Schmidt and V. R. Sidorenko, Multi-Sequence Linear Shift-Register Synthesis: The Varying Length Case, 2006 IEEE International Symposium on Information Theory, pp.1738-1742, 2006.
DOI : 10.1109/ISIT.2006.261652

G. Schmidt, V. R. Sidorenko, and M. Bossert, Collaborative decoding of interleaved reed-solomon codes and concatenated code designs Information Theory Available: http://dx, IEEE Transactions on, vol.55, issue.7, pp.2991-3012, 2009.

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 Information Theory, Online), pp.1274-1287, 1991.

G. Available9j, V. R. Schmidt, and . Sidorenko, Linear Shift-Register Synthesis for Multiple Sequences of Varying Length, p.605044, 2006.

I. A. Zeh, C. Gentner, and D. Augot, A Berlekarnp-Massey Approach for the Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes Information Theory, IEEE Transactions on, 1968.

R. 1. Mceliece, The Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes Available: http, Interplanetary Network Progress Report, vol.153, pp.1-60, 2003.