A note on binary completely regular codes with large minimum distance
Neil I. Gillespie
TL;DR
This paper classifies all binary error-correcting codes that are completely regular with a minimum distance greater than half their length, providing a comprehensive understanding of their structure.
Contribution
It offers a complete classification of binary completely regular codes with large minimum distance, filling a gap in coding theory.
Findings
Identifies all such codes for given parameters
Provides structural properties of these codes
Enhances understanding of error correction capabilities
Abstract
We classify all binary error correcting completely regular codes of length with minimum distance .
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 · Cooperative Communication and Network Coding