Lower bounds on the minimum average distance of binary codes
Beniamin Mounits
TL;DR
This paper introduces new lower bounds on the minimum average Hamming distance of binary codes using a linear programming approach, advancing the understanding of code optimality.
Contribution
It presents novel lower bounds on average Hamming distance for binary codes derived through linear programming techniques.
Findings
New lower bounds established for binary codes
Bounds improve upon previous known limits
Method demonstrates effectiveness of linear programming in coding theory
Abstract
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.
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
TopicsCoding theory and cryptography · graph theory and CDMA systems · Advanced Wireless Communication Techniques