New SDP bounds for sum-rank-metric codes outperform prior bounds in experiments, with shown equivalences between Delsarte and eigenvalue LP bounds plus non-existence results for certain optimal codes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results
New SDP bounds for sum-rank-metric codes outperform prior bounds in experiments, with shown equivalences between Delsarte and eigenvalue LP bounds plus non-existence results for certain optimal codes.