Construction of MRD Codes Based on Circular-Shift Operations
IEEE Transactions on Information Theory · 2026-05 · 72 (5) · 2861-2880
DOI: 10.1109/tit.2026.3673346 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-05. Verfasst von Zhe Zhai und 3 weiteren Autor:innen. Die Arbeit nennt 43 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Quan Cheng Laboratory.
Abstract (Originalsprache)
Most well-known constructions of $(N \times n, q^{Nk}, d)$ maximum rank distance (MRD) codes rely on the arithmetic of $\mathbb {F}_{q^{N}}$ , whose increasing complexity with larger $N$ hinders parameter selection and practical implementation. In this work, based on circular-shift operations, we present a construction of $(J \times n, q^{Jk}, d)$ MRD codes with efficient encoding, where $J$ equals to the Euler’s totient function of a defined $L$ subject to $\gcd (q, L) = 1$ . The proposed construction is performed entirely over $\mathbf {F}_{q}$ and avoids the arithmetic of $\mathbf {F}_{q^{J}}$ . Furthermore, we characterize the constructed MRD codes, Gabidulin codes and twisted Gabidulin codes using a set of $q$ -linearized polynomials over the row vector space $\mathbb {F}_{q}^{N}$ , and clarify the inherent difference and connection among these code families. Specifically, for the case $J \neq m_{L}$ , where $m_{L}$ denotes the multiplicative order of $q$ modulo $L$ , we show that the proposed MRD codes, in a family of settings, are different from any Gabidulin code and any twisted Gabidulin code. For the case $J = m_{L}$ , we prove that every constructed $(J \times n, q^{Jk}, d)$ MRD code coincides with a $(J \times n, q^{Jk}, d)$ Gabidulin code, so that an equivalent circular-shift-based construction of Gabidulin codes is obtained which operates directly over $\mathbb {F}_{q}$ and avoids the arithmetic of $\mathbb {F}_{q^{J}}$ . In addition, we prove that under some parameter settings, the constructed MRD codes are equivalent to a generalization of Gabidulin codes obtained by summing and concatenating several $(m_{L} \times n, q^{m_{L}k}, d)$ Gabidulin codes. When $q=2$ , $L$ is prime and $n\leq m_{L}$ , it is analyzed that generating a codeword of the proposed $((L-1) \times n, 2^{(L-1)k}, d)$ MRD codes requires $O(nkL)$ exclusive OR (XOR) operations, while generating a codeword of $((L-1) \times n, 2^{(L-1)k}, d)$ Gabidulin codes, based on customary construction, requires $O(nkL^{2})$ XOR operations.
Förderung
- National Natural Science Foundation of China
- Quan Cheng Laboratory
Zitieren
APA
Zhai, Z., Jin, S., Sun, Q. T., & Li, Z. (2026). Construction of MRD Codes Based on Circular-Shift Operations. IEEE Transactions on Information Theory, 72(5), 2861-2880. https://doi.org/10.1109/tit.2026.3673346
Vancouver
Zhai Z, Jin S, Sun QT, Li Z. Construction of MRD Codes Based on Circular-Shift Operations. IEEE Transactions on Information Theory. 2026;72(5):2861-2880. doi:10.1109/tit.2026.3673346
BibTeX
@article{Zhai2026,
author = {Zhai, Zhe and Jin, Sheng and Sun, Qifu Tyler and Li, Zongpeng},
title = {Construction of MRD Codes Based on Circular-Shift Operations},
journal = {IEEE Transactions on Information Theory},
year = {2026},
volume = {72},
number = {5},
pages = {2861--2880},
doi = {10.1109/tit.2026.3673346}
}
EUVIMED