Bounds for binary codes relative to pseudo-distances of k points
Christine Bachoc (IMB), Gilles Zemor (IMB)
TL;DR
This paper uses advanced semidefinite programming techniques to derive tighter upper bounds on the generalized distances and list decoding radii of binary codes, enhancing understanding of their limits.
Contribution
It introduces improved upper bounds for binary codes' distances and decoding radii using Schrijver's semidefinite programming approach, advancing coding theory methods.
Findings
Tighter upper bounds on generalized distances.
Enhanced bounds on list decoding radii.
Application of semidefinite programming to coding theory.
Abstract
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
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 · graph theory and CDMA systems · Advanced Optimization Algorithms Research