New extremal singly even self-dual codes of lengths $64$ and $66$
Damyan Anev, Masaaki Harada, Nikolay Yankov

TL;DR
This paper constructs new extremal singly even self-dual codes of lengths 64 and 66, and introduces 40 new inequivalent extremal doubly even self-dual codes of length 64 with optimal covering radius, expanding known code classes.
Contribution
It presents the first known extremal singly even self-dual codes for lengths 64 and 66, and 40 new extremal doubly even codes of length 64 with optimal covering radius.
Findings
New extremal singly even self-dual codes for lengths 64 and 66.
40 new inequivalent extremal doubly even self-dual codes of length 64.
Codes meet known optimal bounds such as the Delsarte bound.
Abstract
For lengths and , we construct extremal singly even self-dual codes with weight enumerators for which no extremal singly even self-dual codes were previously known to exist. We also construct new inequivalent extremal doubly even self-dual codes with covering radius meeting the Delsarte bound.
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.
