TL;DR
This paper presents a new lower bound for the size of binary codes with specific length, weight, and minimum distance, by constructing a record-breaking code with 113 codewords.
Contribution
It introduces a novel construction that improves the known lower bound for A(17,6,6), the maximum size of such codes.
Findings
Constructed a binary code with 113 codewords
Achieved a new lower bound for A(17,6,6)
Demonstrated the existence of larger codes with these parameters
Abstract
We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.
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
TopicsFinite Group Theory Research · Coding theory and cryptography