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
Efficient decoding of Reed-Solomon codes beyond half the minimum distance, IEEE Transactions on Information Theory, vol.46, issue.1, pp.246-257, 2000. ,
DOI : 10.1109/18.817522
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.817522-817525, 1991. ,
An iterative algorithm of shift-register synthesis for multiple sequences, Science in China) Series A, pp.1222-1232, 1985. ,
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, 2001. ,
Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik, J. Reine Angew. Math, vol.175, pp.50-54, 1936. ,
Modern Computer Algebra Available: http://www.amazon.ca, pp.9-20, 2003. ,
A New Procedure for Decoding Cyclic and Bch Codes Up to Actual Minimum Distance, Proceedings. IEEE International Symposium on Information Theory, pp.1364-1374, 1994. ,
DOI : 10.1109/ISIT.1993.748410
n-dimensional Berlekamp-Massey algorithm for multiple arrays and construction of multivariate polynomials with preassigned zeros, " in Applied algebra, algebraic algorithms and error-correcting codes (Rome, 1988), ser, Lecture Notes in Computer Science, vol.357, pp.356-376, 1989. ,
Linear Shift-Register Synthesis for Multiple Sequences of Varying Length, p.605044, 2006. ,
Decoding Reed??Solomon Codes Beyond Half the Minimum Distance using Shift-Register Synthesis, 2006 IEEE International Symposium on Information Theory, pp.459-463, 2006. ,
DOI : 10.1109/ISIT.2006.261711