Sur la reconstruction des polynômes linéaires : un nouvel algorithme de décodage des codes de Gabidulin
Open Access
- 2 November 2004
- journal article
- Published by Cellule MathDoc/Centre Mersenne in Comptes Rendus Mathematique
- Vol. 339 (10) , 745-750
- https://doi.org/10.1016/j.crma.2004.10.004
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Reducible rank codes and their applications to cryptographyIEEE Transactions on Information Theory, 2003
- Maximum-rank array codes and their application to crisscross error correctionIEEE Transactions on Information Theory, 1991
- Contributions to the theory of finite fieldsTransactions of the American Mathematical Society, 1934
- On a special class of polynomialsTransactions of the American Mathematical Society, 1933