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 | |
| Publication status | Published - Jan 2025 |
Funding
Aida Abiad is supported by NWO (Dutch Research Council) through the grant VI.Vidi.213.085. The research of Alexander Gavrilyuk is supported by JSPS KAKENHI Grant Number 22K03403. Antonina P. Khramova is supported by NWO via the grant OCENW.KLEIN.475. This work was initiated during the RICCOTA conference, Croatia, in July 2023; the authors would like to thank the organizers of the event. This work was initiated during the RICCOTA conference, Croatia, in July 2023; the authors would like to thank the organizers of the event. The work of Aida Abiad was supported by Dutch Research Council (NWO) under Grant VI.Vidi.213.085. The work of Alexander L. Gavrilyuk was supported by the Japan Society for the Promotion of Science (JSPS) KAKENHI under Grant 22K03403. The work of Antonina P. Khramova was supported by NWO under Grant OCENW.KLEIN.475.
Keywords
- association scheme
- eigenvalues
- linear programming bound
- sum-rank metric code
- sum-rank metric graph
Fingerprint
Dive into the research topics of 'A linear programming bound for sum-rank metric codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver