Aida Abiad, Alexander L. Gavrilyuk, Antonina P. Khramova, Ilia Ponomarenko
Published 2024-06-22Version 1
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.
An Improved Linear Programming Bound on the Average Distance of a Binary Code
On the spectrum and linear programming bound for hypergraphs
Quorum colorings of maximum cardinality in linear time for a subclass of perfect trees
![QR code for arXiv:2406.15926 [math.CO]](http://oss.arxitics.com/images/favicon.svg)