Maximum-sum-rank distance (MSRD) code[1]
Also known as Optimal sum-rank-distance code.
Description
An \([n\times m,k,d]_q\) rank-metric code whose parameters are such that the sum-rank-metric Singleton bound [1; Prop. 34] \begin{align} d_{\text{SR}}(C) \leq n - k + 1 \tag*{(1)}\end{align} becomes an equality, where \(d_{\text{SR}}\) is the sum-rank metric.
Parent
Child
Cousins
References
- [1]
- U. Martínez-Peñas, “Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring”, (2018) arXiv:1710.03109
Page edit log
- Victor V. Albert (2024-08-15) — most recent
Cite as:
“Maximum-sum-rank distance (MSRD) code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/maximum_sum_rank_distance