Skip to main content
main-content

Tipp

Weitere Artikel dieser Ausgabe durch Wischen aufrufen

31.10.2017 | Ausgabe 9/2018

Designs, Codes and Cryptography 9/2018

On the number of inequivalent Gabidulin codes

Zeitschrift:
Designs, Codes and Cryptography > Ausgabe 9/2018
Autoren:
Kai-Uwe Schmidt, Yue Zhou
Wichtige Hinweise
Communicated by G. Lunardon.

Abstract

Maximum rank-distance (MRD) codes are extremal codes in the space of \(m\times n\) matrices over a finite field, equipped with the rank metric. Up to generalizations, the classical examples of such codes were constructed in the 1970s and are today known as Gabidulin codes. Motivated by several recent approaches to construct MRD codes that are inequivalent to Gabidulin codes, we study the equivalence issue for Gabidulin codes themselves. This shows in particular that the family of Gabidulin codes already contains a huge subset of MRD codes that are pairwise inequivalent, provided that \(2\leqslant m\leqslant n-2\).

Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten

Literatur
Über diesen Artikel

Weitere Artikel der Ausgabe 9/2018

Designs, Codes and Cryptography 9/2018 Zur Ausgabe

Premium Partner

    Bildnachweise