Maximum Rank Distance (MRD) Codes

• MRD codes are matrix-based codes measured by rank, achieving the Singleton bound and serving as rank-metric analogues of MDS codes.
• Key constructions include Gabidulin and twisted Gabidulin families that utilize linearized polynomials for efficient encoding and decoding.
• Their rich algebraic structure and classification up to equivalence inform applications in network coding, finite geometry, and error correction.

Maximum Rank Distance (MRD) codes are rank-metric analogues of maximum distance separable codes: they are codes in spaces of matrices, or equivalently in $\mathbb{F}_{q^m}^n$, whose minimum distance is measured by rank and whose size attains the rank-metric Singleton bound. They were constructed and studied independently by Delsarte, Gabidulin, Roth, and Cooperstein, and they occupy a central position at the intersection of coding theory, linearized polynomials, semifields, finite geometry, and random linear network coding (Sheekey, 2019).

1. Rank metric and extremal parameters

For matrices $A,B\in K^{m\times n}$, the rank distance is

$d(A,B)=\operatorname{rank}(A-B).$

A rank-metric code is a subset of $K^{m\times n}$ endowed with this metric. Over $\mathbb{F}_q$, if $\mathcal{C}\subseteq \mathbb{F}_q^{m\times n}$ has minimum distance $d$, then

$$|\mathcal{C}| \le q^{\max\{m,n\}(\min\{m,n\}-d+1)}.$$

When equality holds, $\mathcal{C}$ is an MRD code. In the common regime $m\le n$, the extremal cardinality is $A,B\in K^{m\times n}$0; equivalently, for an $A,B\in K^{m\times n}$1-linear code of length $A,B\in K^{m\times n}$2 and dimension $A,B\in K^{m\times n}$3, the Singleton-type bound becomes $A,B\in K^{m\times n}$4, and MRD means $A,B\in K^{m\times n}$5 (Lunardon et al., 2015).

This places MRD codes in exact parallel with MDS codes in the Hamming metric. The analogy is structural as well as formal: MRD codes are the extremal objects for rank distance, and several papers explicitly frame them as the rank-metric counterparts of MDS codes [0610099].

2. Linearized-polynomial models and principal infinite families

A standard algebraic model identifies $A,B\in K^{m\times n}$6-linear endomorphisms of $A,B\in K^{m\times n}$7 with $A,B\in K^{m\times n}$8-linearized polynomials

$A,B\in K^{m\times n}$9

This model underlies the classical Gabidulin construction and most later generalizations (Sheekey, 2015).

The generalized Gabidulin code is

$d(A,B)=\operatorname{rank}(A-B).$0

with $d(A,B)=\operatorname{rank}(A-B).$1. It is an $d(A,B)=\operatorname{rank}(A-B).$2-linear MRD code of size $d(A,B)=\operatorname{rank}(A-B).$3 (Lunardon et al., 2015).

Sheekey’s twisted Gabidulin family modifies the highest $d(A,B)=\operatorname{rank}(A-B).$4-degree term: $d(A,B)=\operatorname{rank}(A-B).$5 under the norm constraint

$d(A,B)=\operatorname{rank}(A-B).$6

This family contains the only known family for general parameters, the Gabidulin codes, and contains codes inequivalent to the Gabidulin codes; for $d(A,B)=\operatorname{rank}(A-B).$7 it also contains the well-known family of semifields known as Generalised Twisted Fields (Sheekey, 2015).

A further extension is the generalized twisted Gabidulin family

$d(A,B)=\operatorname{rank}(A-B).$8

again with a norm condition. Up to equivalence, generalized Gabidulin codes and twisted Gabidulin codes are both proper subsets of this family (Lunardon et al., 2015).

Family	Defining feature	Relation
Generalized Gabidulin	Consecutive $d(A,B)=\operatorname{rank}(A-B).$9-powers	Classical MRD family
Twisted Gabidulin	Extra term $K^{m\times n}$0	Contains Gabidulin when $K^{m\times n}$1
Generalized twisted Gabidulin	Arbitrary step $K^{m\times n}$2 plus twist at $K^{m\times n}$3	Strictly larger, up to equivalence

These constructions establish that the classical Gabidulin paradigm is not the whole linear MRD landscape, even within highly structured $K^{m\times n}$4-polynomial families (Sheekey, 2015).

3. Idealizers, nuclei, equivalence, and geometric correspondences

Left and right idealizers are major invariants of linear rank-distance codes. For $K^{m\times n}$5,

$K^{m\times n}$6

For $K^{m\times n}$7-linear MRD codes in $K^{m\times n}$8, the idealizers are finite fields of size at most $K^{m\times n}$9. Generalized Gabidulin codes were long the only known MRD codes with maximum left and right idealizers, but a classification for $\mathbb{F}_q$0 shows additional families: for $\mathbb{F}_q$1, $\mathbb{F}_q$2 odd, and for $\mathbb{F}_q$3, $\mathbb{F}_q$4, there exist MRD codes with maximum idealizers that are not equivalent to any previously known MRD code (Csajbók et al., 2018).

Another structured non-Gabidulin family is

$\mathbb{F}_q$5

which yields MRD codes in $\mathbb{F}_q$6 whose middle and right nuclei are both equal to $\mathbb{F}_q$7. For $\mathbb{F}_q$8, the codes in this family are inequivalent to all known ones (Trombetti et al., 2017).

Finite-geometry correspondences are equally central. Two-dimensional $\mathbb{F}_q$9-linear MRD codes with distance $\mathcal{C}\subseteq \mathbb{F}_q^{m\times n}$0 are tied to maximum scattered linear sets on $\mathcal{C}\subseteq \mathbb{F}_q^{m\times n}$1; for the family $\mathcal{C}\subseteq \mathbb{F}_q^{m\times n}$2, the equivalence problem was completed for all $\mathcal{C}\subseteq \mathbb{F}_q^{m\times n}$3, and when $\mathcal{C}\subseteq \mathbb{F}_q^{m\times n}$4 the resulting linear sets in $\mathcal{C}\subseteq \mathbb{F}_q^{m\times n}$5 are not equivalent to any one known so far (Gupta et al., 2022).

The link with semifields is especially strong at the extremal distance $\mathcal{C}\subseteq \mathbb{F}_q^{m\times n}$6. Additive MRD codes with minimum distance $\mathcal{C}\subseteq \mathbb{F}_q^{m\times n}$7 in $\mathcal{C}\subseteq \mathbb{F}_q^{m\times n}$8 are exactly semifield spread sets, and over $\mathcal{C}\subseteq \mathbb{F}_q^{m\times n}$9 an additive MRD code with minimum distance $d$0 must contain a semifield spread set; such codes were classified for $d$1 (Sheekey, 2018).

4. Asymptotics, genericity, and the size of the MRD universe

The asymptotic theory of rank-metric codes differs sharply from the Hamming-metric case. Gilbert and sphere-packing bounds were established for the rank metric, together with their asymptotic forms and the Singleton bound. On that basis it was observed that asymptotically Gilbert-Varshamov bound is exceeded by MRD codes and sphere-packing bound cannot be attained. The same work also showed that all MRD codes are maximal codes and that all the MRD codes known so far achieve the maximum rank covering radius [0610099].

A complementary viewpoint comes from algebraic geometry and probability. For linear rank-metric codes in $d$2, the properties of being MRD and non-Gabidulin are generic over the algebraic closure of the underlying field. Consequently, over a large extension field a randomly chosen generator matrix generates an MRD and a non-Gabidulin code with high probability, and explicit upper bounds on these probabilities can be given in terms of the extension degree $d$3 (Neri et al., 2016).

Even the classical Gabidulin class is much larger, up to equivalence, than its traditional presentation suggests. For $d$4, there are at least

$d$5

pairwise inequivalent $d$6-linear Gabidulin MRD codes in $d$7 with minimum distance $d$8 (Schmidt et al., 2017).

Recent switching constructions amplify this picture. MRD codes are maximum codes in the rank-distance metric space on $d$9-by-$$|\mathcal{C}| \le q^{\max\{m,n\}(\min\{m,n\}-d+1)}.$$0 matrices over the finite field of order $$|\mathcal{C}| \le q^{\max\{m,n\}(\min\{m,n\}-d+1)}.$$1; they are diameter perfect, and switching replaces special MRD subcodes by other subcodes with the same parameters. This yields a huge class of MRD codes whose cardinality grows doubly exponentially in $$|\mathcal{C}| \le q^{\max\{m,n\}(\min\{m,n\}-d+1)}.$$2 if the other parameters are fixed, together with MRD codes of different affine ranks and aperiodic MRD codes (Shi et al., 2022). A plausible implication is that exhaustive classification up to equivalence becomes rapidly harder as parameters grow.

5. Decoding, elementary linear subspaces, and decoder-error exponents

Operationally, MRD codes are often studied under bounded rank-distance decoding with correction capability

$$|\mathcal{C}| \le q^{\max\{m,n\}(\min\{m,n\}-d+1)}.$$3

A notable development introduced the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. Elementary linear subspaces are then used to derive properties of MRD codes that parallel those of MDS codes [0612051].

Within that framework, the decoder error probability of bounded rank distance decoders can be analyzed under the assumption that all errors with the same rank are equally likely. For MRD codes with error correction capability $$|\mathcal{C}| \le q^{\max\{m,n\}(\min\{m,n\}-d+1)}.$$4, the decoder error probability decreases exponentially with $$|\mathcal{C}| \le q^{\max\{m,n\}(\min\{m,n\}-d+1)}.$$5 under that assumption [0612051].

A companion formulation makes the channel interpretation explicit: the same-rank equiprobability model is argued to be an approximation of a channel corrupted by crisscross errors [0610148]. This identifies one of the distinctive advantages of MRD codes in array-like or matrix-valued channels: the relevant error severity is rank, not Hamming weight, and the resulting bounded-distance decoder error exponent is quadratic in the correction capability.

6. Extensions, implementation, and application domains

MRD theory now sits inside the broader framework of maximum sum-rank distance codes. Over finite chain rings, linearized Reed-Solomon codes were extended and proven MSRD; in the single-block case, this specializes back to the rank metric and hence to the MRD setting. The same work developed a general cubic-complexity sum-rank Welch-Berlekamp decoder and a quadratic-complexity sum-rank syndrome decoder under additional assumptions, with the latter also constituting the first known syndrome decoder for linearized Reed-Solomon codes over finite fields. Applications include Space-Time Coding with multiple fading blocks and physical-layer multishot Network Coding (Martínez-Peñas et al., 2021).

A recent implementation-oriented direction replaces extension-field arithmetic by circular-shift structure. Based on circular-shift operations, a construction of $$|\mathcal{C}| \le q^{\max\{m,n\}(\min\{m,n\}-d+1)}.$$6 MRD codes was given that is performed entirely over $$|\mathcal{C}| \le q^{\max\{m,n\}(\min\{m,n\}-d+1)}.$$7 and avoids the arithmetic of $$|\mathcal{C}| \le q^{\max\{m,n\}(\min\{m,n\}-d+1)}.$$8. For $$|\mathcal{C}| \le q^{\max\{m,n\}(\min\{m,n\}-d+1)}.$$9, in a family of settings the resulting codes are different from any Gabidulin code and any twisted Gabidulin code; for $\mathcal{C}$0, every constructed code coincides with a Gabidulin code, yielding an equivalent circular-shift-based construction that operates directly over $\mathcal{C}$1. When $\mathcal{C}$2, $\mathcal{C}$3 is prime, and $\mathcal{C}$4, generating a codeword requires $\mathcal{C}$5 XOR operations, whereas customary Gabidulin construction requires $\mathcal{C}$6 XOR operations (Zhai et al., 13 Feb 2026).

Across these developments, MRD codes remain central because they combine extremal distance, rich algebraic structure, and wide applicability. Their modern theory now includes classical Gabidulin and generalized Gabidulin codes, twisted and generalized twisted variants, semifield-linked families, constructions with prescribed nuclei or idealizers, switching-based nonlinear families, and implementation-oriented realizations over $\mathcal{C}$7, while continuing to feed applications in network coding, cryptography, finite geometry, and coded modulation (Sheekey, 2019).