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
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
Error decoding strategies for algebraic codes Available, 2001. ,
On the Roth and Ruckenstein Equations for the Guruswami-Sudan Algorithm," in Information Theory, IEEE International Symposium on, pp.2620-26244595466, 2008. ,
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
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. ,
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. ,
Linear Shift-Register Synthesis for Multiple Sequences of Varying Length, p.605044, 2006. ,
A Berlekarnp-Massey Approach for the Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes Information Theory, IEEE Transactions on, 1968. ,
The Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes Available: http, Interplanetary Network Progress Report, vol.153, pp.1-60, 2003. ,