Maximum rank-distance codes with maximum left and right idealisers.

TLDR: This paper classifies MRD codes in $\mathbb{F}_q^{n\times n}$ with maximum left and right idealisers and connect them to Moore type matrices and shows that this family of rank-distance codes does not provide any further examples for $n\geq 9$.

Abstract: Left and right idealisers are important invariants of linear rank-distance codes. In case of maximum rank-distance (MRD for short) codes in $\mathbb{F}_q^{n\times n}$ the idealisers have been proved to be isomorphic to finite fields of size at most $q^n$. Up to now, the only known MRD codes with maximum left and right idealisers are generalized Gabidulin codes, which were first constructed in 1978 by Delsarte and later generalized by Kshevetskiy and Gabidulin in 2005. In this paper we classify MRD codes in $\mathbb{F}_q^{n\times n}$ for $n\leq 9$ with maximum left and right idealisers and connect them to Moore type matrices. Apart from generalized Gabidulin codes, it turns out that there is a further family of rank-distance codes providing MRD ones with maximum idealisers for $n=7$, $q$ odd and for $n=8$, $q\equiv 1 \pmod 3$. These codes are not equivalent to any previously known MRD code. Moreover, we show that this family of rank-distance codes does not provide any further examples for $n\geq 9$.