A linear programming bound for sum-rank metric codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911929999556608 |
|---|---|
| author | Abiad, Aida Gavrilyuk, Alexander L. Khramova, Antonina P. Ponomarenko, Ilia |
| author_facet | Abiad, Aida Gavrilyuk, Alexander L. Khramova, Antonina P. Ponomarenko, Ilia |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_15926 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A linear programming bound for sum-rank metric codes Abiad, Aida Gavrilyuk, Alexander L. Khramova, Antonina P. Ponomarenko, Ilia Combinatorics 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. |
| title | A linear programming bound for sum-rank metric codes |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2406.15926 |