A linear programming bound for sum-rank metric codes
Aida Abiad, Alexander L. Gavrilyuk, Antonina P. Khramova, Ilia, Ponomarenko
TL;DR
This paper introduces a linear programming bound for sum-rank metric codes, demonstrating through computational experiments that it surpasses all previous bounds in certain cases.
Contribution
The authors develop a new linear programming bound for sum-rank metric codes, providing improved upper limits on code sizes compared to prior bounds.
Findings
The new bound outperforms existing bounds in small instances.
Computational experiments validate the effectiveness of the new bound.
The approach offers potential for tighter bounds in coding theory.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Advanced Wireless Network Optimization · Coding theory and cryptography