Improved Gilbert–Varshamov Bound for Sum-Rank-Metric Codes via Graph Theory
IEEE Transactions on Information Theory · 2026-07 · 72 (7) · 4828-4836
DOI: 10.1109/tit.2026.3691929 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-07. Verfasst von Aida Abiad und 2 weiteren Autor:innen. Gefördert von: U.
Abstract (Originalsprache)
We use a graph-theoretic approach which yields improvements on the known Gilbert-Varshamov (GV) bound for sum-rank-metric codes for certain parameters. In particular, we show that asymptotically $\mathbb {F}_{q}^{\mathbf {n}\times \mathbf {m}}$ can be partitioned into sum-rank-metric codes whose average size is bigger than the GV bound by a logarithmic factor for these parameters. Finally, we discuss the connection of such codes to set-coloring Ramsey numbers.
Förderung
- U
Zitieren
APA
Abiad, A., Reijnders, H., & Tait, M. (2026). Improved Gilbert–Varshamov Bound for Sum-Rank-Metric Codes via Graph Theory. IEEE Transactions on Information Theory, 72(7), 4828-4836. https://doi.org/10.1109/tit.2026.3691929
Vancouver
Abiad A, Reijnders H, Tait M. Improved Gilbert–Varshamov Bound for Sum-Rank-Metric Codes via Graph Theory. IEEE Transactions on Information Theory. 2026;72(7):4828-4836. doi:10.1109/tit.2026.3691929
BibTeX
@article{Abiad2026,
author = {Abiad, Aida and Reijnders, Harper and Tait, Michael},
title = {Improved Gilbert–Varshamov Bound for Sum-Rank-Metric Codes via Graph Theory},
journal = {IEEE Transactions on Information Theory},
year = {2026},
volume = {72},
number = {7},
pages = {4828--4836},
doi = {10.1109/tit.2026.3691929}
}
EUVIMED