TY - JOUR
T1 - A linear programming bound for sum-rank metric codes
AU - Abiad, Aida
AU - Gavrilyuk, Alexander L.
AU - Khramova, Antonina P.
AU - Ponomarenko, Ilia
PY - 2025/1
Y1 - 2025/1
N2 - 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.
AB - 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.
KW - association scheme
KW - eigenvalues
KW - linear programming bound
KW - sum-rank metric code
KW - sum-rank metric graph
UR - http://www.scopus.com/inward/record.url?scp=85209101401&partnerID=8YFLogxK
U2 - 10.1109/TIT.2024.3488902
DO - 10.1109/TIT.2024.3488902
M3 - Article
AN - SCOPUS:85209101401
SN - 0018-9448
VL - 71
SP - 317
EP - 329
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 1
M1 - 10741552
ER -