Autor:	Abiad, Aida, Gavrilyuk, Alexander L., Khramova, Antonina P., Ponomarenko, Ilia
Rok vydání:	2024
Předmět:	Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all previously known bounds.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2406.15926 Zobrazit plný text záznamu View this record from Arxiv