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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Optimization of inertia-type bounds for k-independence and distance-k chromatic numbers of graphs is polynomial-time solvable for fixed k.
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.
-
Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers
Optimization of inertia-type bounds for k-independence and distance-k chromatic numbers of graphs is polynomial-time solvable for fixed k.