Theory of Codes with Maximum Rank Distance, Probl. Peredachi Inf, vol.21, issue.1, pp.3-16, 1985. ,
Kodirovanie v radioelektronike (Coding in Radio Electronics), 1986. ,
Complexity of decoding Gabidulin codes, 2008 42nd Annual Conference on Information Sciences and Systems, pp.1081-1085, 2008. ,
DOI : 10.1109/CISS.2008.4558679
Normal Bases over Finite Fields, 1993. ,
A New Algorithm for Decoding Reed-Solomon Codes, Communications , Information and Network Security, pp.55-68, 2002. ,
DOI : 10.1007/978-1-4757-3789-9_5
A Welch?Berlekamp Like Algorithm for Decoding Gabidulin Codes. Coding and Cryptography pp, pp.36-45, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00459611
On a special class of polynomials, Transactions of the American Mathematical Society, vol.35, issue.3, pp.559-584, 1933. ,
DOI : 10.1090/S0002-9947-1933-1501703-0
An Analogue of Berlekamp-Massey Algorithm for Decoding Codes in Rank Metric, Proc. of MIPT, 1991. ,
Error and Erasure Decoding of Rank-Codes with a Modified Berlekamp-Massey Algorithm, 5th International ITG Conference on Source and Channel Coding (SCC), pp.203-211, 2004. ,
Linearized Shift-Register Synthesis, IEEE Transactions on Information Theory, vol.57, issue.9, 2011. ,
DOI : 10.1109/TIT.2011.2162173
Fast encoding and decoding of Gabidulin codes, 2009 IEEE International Symposium on Information Theory, 2009. ,
DOI : 10.1109/ISIT.2009.5205272
A Fast Linearized Euclidean Algorithm for Decoding Gabidulin Codes, Twelfth International Workshop on Algebraic and Combinatorial Coding Theory, pp.298-303, 2010. ,