A Welch–Berlekamp Like Algorithm for Decoding Gabidulin Codes

This publication has 7 references indexed in Scilit:

• A fast matrix decoding algorithm for rank-error-correcting codes
  Published by Springer Nature ,2005
• Sur la reconstruction des polynômes linéaires : un nouvel algorithme de décodage des codes de Gabidulin
  Comptes Rendus Mathematique, 2004
• New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications
  Problems of Information Transmission, 2002
• Ideals over a Non-Commutative Ring and their Application in Cryptology
  Published by Springer Nature ,2001
• Maximum-rank array codes and their application to crisscross error correction
  IEEE Transactions on Information Theory, 1991
• Contributions to the theory of finite fields
  Transactions of the American Mathematical Society, 1934
• On a special class of polynomials
  Transactions of the American Mathematical Society, 1933