Abstract: MRD codes maximum codes in the rank-distance metric space on $m$-by-$n$ matrices over a finite field $F_q$. They are distance perfect and have the cardinality $q^{m(n-d+1)}$ if $m≥n$. We show that the number of MRD codes grows doubly exponentially in $m$ if the other parameters ($n$, $q$, the code distance) are fixed. This is joint work with ‪Ferruh Özbudak and Minjia Shi

Cite: Krotov D.
On constructing nonlinear MRD codes
The 6th Workshop On Algebraic Graph Theory and Its Applications 21-25 Mar 2022