A Linear Programming Bound for Sum-Rank Metric Codes
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.
Authors
- Ilia Ponomarenko (ORCID: https://orcid.org/0000-0003-2444-731X)
- Alexander L. Gavrilyuk (ORCID: https://orcid.org/0000-0001-9296-0313)
- Antonina P. Khramova (ORCID: https://orcid.org/0000-0002-9989-8986)
- Aida Abiad (ORCID: https://orcid.org/0000-0003-4003-4291)
Institutions
- Shimane University (JP)
- Hainan University (CN)
- Eindhoven University of Technology (NL)
Publication Details
- Journal
- IEEE Transactions on Information Theory
- Published
- 2024-11-04
- DOI
- https://doi.org/10.1109/tit.2024.3488902
- Citations
- 3
- Primary Topic
- Cooperative Communication and Network Coding
- Type
- article
- Field-Weighted Citation Impact
- 1.05
Funders
- University of Memphis
- Ernest Kleinwort Charitable Trust
- Universiteit Maastricht
- Chinese Academy of Sciences
- Technische Universiteit Eindhoven
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek
- Saint Petersburg State University
- Shimane University
- Universiteit Gent
- Vrije Universiteit Brussel
- Hainan University
- Universiteit van Tilburg
- Japan Society for the Promotion of Science
- Russian Academy of Sciences
- Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences
- Division of Mathematical Sciences