Bounds for projective codes from semidefinite programming
Christine Bachoc (IMB), Alberto Passuello (IMB), Frank Vallentin (TWA)
TL;DR
This paper introduces a semidefinite programming approach to establish bounds for projective codes over finite fields, enhancing the theoretical understanding of code limitations.
Contribution
It applies semidefinite programming to derive new bounds for projective codes, a novel approach in coding theory.
Findings
Derived new bounds for projective codes
Demonstrated effectiveness of semidefinite programming in coding bounds
Provided theoretical insights into code limitations
Abstract
We apply the semidefinite programming method to derive bounds for projective codes over a finite field.
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
TopicsComplexity and Algorithms in Graphs · Limits and Structures in Graph Theory · Coding theory and cryptography