[Jump to code hierarchy]

Maximum-rank distance (MRD) code [1–3]

Alternative Names: Optimal rank-distance code.

Description

A rank-metric code whose parameters satisfy the rank-metric Singleton-like bound with equality.

An \([n\times m,k,d]_q\) rank-metric code is MRD if its parameters are such that the Singleton-like bound \begin{align} k \leq \max(n, m) (\min(n, m) - d + 1)\tag*{$(1)$} \end{align}becomes an equality.

Realizations

Useful for error and erasure correction in network coding [4,5].

Cousins

References

  1. [1]

    P. Delsarte, “Bilinear forms over a finite field, with applications to coding theory”, Journal of Combinatorial Theory, Series A 25, 226 (1978) DOI

  2. [2]

    E. M. Gabidulin, “Theory of Codes with Maximum Rank Distance”, Problemy Peredachi Informatsii 21(1), 3–16 (1985)

  3. [3]

    R. M. Roth, “Maximum-rank array codes and their application to crisscross error correction”, IEEE Transactions on Information Theory 37, 328 (1991) DOI

  4. [4]

    R. Koetter and F. Kschischang, “Coding for Errors and Erasures in Random Network Coding”, (2008) arXiv:cs/0703061

  5. [5]

    D. Silva, F. R. Kschischang, and R. Koetter, “A Rank-Metric Approach to Error Control in Random Network Coding”, IEEE Transactions on Information Theory 54, 3951 (2008) arXiv:0711.0708 DOI

  6. [6]

    T. Etzion, E. Gorla, A. Ravagnani, and A. Wachter-Zeh, “Optimal Ferrers Diagram Rank-Metric Codes”, IEEE Transactions on Information Theory 62, 1616 (2016) DOI

  7. [7]

    F.-W. Fu, X. Gao, S. Mesnager, and G. Wang, “Optimal Ferrers Diagram Rank-Metric Codes: New Constructions, Diagram Combinations, and Applications to Constant-Dimension Subspace Codes”, (2026) arXiv:2609.24239

Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: maximum_rank_distance

Cite as:
“Maximum-rank distance (MRD) code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/maximum_rank_distance, arXiv:2606.11484
BibTeX:
@incollection{eczoo_maximum_rank_distance,
title={Maximum-rank distance (MRD) code},
booktitle={The Error Correction Zoo},
year={2026},
editor={Albert, Victor V. and Faist, Philippe},
eprint={2606.11484},
doi={10.48550/arXiv.2606.11484},
url={https://errorcorrectionzoo.org/c/maximum_rank_distance}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/maximum_rank_distance

Cite as:

“Maximum-rank distance (MRD) code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/maximum_rank_distance, arXiv:2606.11484

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/classical/matrices/sum-rank-metric/rank-metric/maximum_rank_distance.yml.