Applications of semidefinite programming to coding theory
Christine Bachoc (IMB)
TL;DR
This paper surveys recent advancements in applying semidefinite programming to coding theory, highlighting generalizations, improvements, and a framework involving group representations and graph theory.
Contribution
It introduces a unified framework combining group representations and graph theory to enhance semidefinite programming methods in coding theory.
Findings
Enhanced bounds for coding problems using semidefinite programming
Unified framework integrating group theory and graph theory
Improved algorithms for coding theory applications
Abstract
We survey recent generalizations and improvements of the linear programming method that involve semidefinite programming. A general framework using group representations and tools from graph theory is provided.
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
TopicsAdvanced Optimization Algorithms Research · Complexity and Algorithms in Graphs · Optimization and Variational Analysis