A linear programming bound for sum-rank metric codes
Combinatorics
2024-06-25 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2406.15926,
title = {A linear programming bound for sum-rank metric codes},
author = {Aida Abiad and Alexander L. Gavrilyuk and Antonina P. Khramova and Ilia Ponomarenko},
journal= {arXiv preprint arXiv:2406.15926},
year = {2024}
}