A linear programming bound for sum-rank metric codes

Aida Abiad; Alexander L. Gavrilyuk; Antonina P. Khramova; Ilia Ponomarenko

doi:10.1109/TIT.2024.3488902

A linear programming bound for sum-rank metric codes

Aida Abiad (Corresponding author), Alexander L. Gavrilyuk, Antonina P. Khramova, Ilia Ponomarenko

Algebraic Combinatorics

Research output: Contribution to journal › Article › Academic › peer-review

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.

Original language	English
Article number	10741552
Pages (from-to)	317-329
Number of pages	13
Journal	IEEE Transactions on Information Theory
Volume	71
Issue number	1
Early online date	4 Nov 2024
DOIs	https://doi.org/10.1109/TIT.2024.3488902
Publication status	Published - Jan 2025

Keywords

association scheme
eigenvalues
linear programming bound
sum-rank metric code
sum-rank metric graph

Access to Document

10.1109/TIT.2024.3488902

Cite this

@article{c8e9710b493e483bb7e2fe26f64fc594,

title = "A linear programming bound for sum-rank metric codes",

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 = "association scheme, eigenvalues, linear programming bound, sum-rank metric code, sum-rank metric graph",

author = "Aida Abiad and Gavrilyuk, {Alexander L.} and Khramova, {Antonina P.} and Ilia Ponomarenko",

year = "2025",

month = jan,

doi = "10.1109/TIT.2024.3488902",

language = "English",

volume = "71",

pages = "317--329",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "1",

}

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 -

A linear programming bound for sum-rank metric codes

Abstract

Keywords

Access to Document

Other files and links

Embargoed Document

Fingerprint

Cite this