Neighborhoods of binary self-dual codes
Carolin Hannusch, S. Roland Major
TL;DR
This paper explores the properties and limitations of binary self-dual codes, establishing new bounds and conditions for their existence and comparing Type I and Type II codes.
Contribution
It introduces the concept of neighborhoods of binary self-dual codes and provides new necessary conditions for specific code parameters.
Findings
No better Type I code than the best Type II code of the same length.
New necessary conditions for the existence of certain singly-even and doubly-even codes.
Abstract
In this paper, we introduce and investigate the neighborhood of binary self-dual codes. We prove that there is no better Type I code than the best Type II code of the same length. Further, we give some new necessary conditions for the existence of a singly-even -code and a doubly-even -code.
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