Classification of extremal and $s$-extremal binary self-dual codes of length 38
Carlos Aguilar-Melchor, Philippe Gaborit, Jon-Lark Kim, Lin Sok and, Patrick Sol\'e

TL;DR
This paper classifies all extremal and s-extremal binary self-dual codes of length 38, identifying their quantities and types using a recursive algorithm and its generalization, advancing the understanding of these codes.
Contribution
It provides the first complete classification of extremal and s-extremal binary self-dual codes of length 38, utilizing a novel recursive algorithm and its extension.
Findings
2744 extremal [38,19,8] codes identified
Two s-extremal [38,19,6] codes found
1730 s-extremal [38,19,8] codes classified
Abstract
In this paper we classify all extremal and -extremal binary self-dual codes of length 38. There are exactly 2744 extremal self-dual codes, two -extremal codes, and 1730 -extremal codes. We obtain our results from the use of a recursive algorithm used in the recent classification of all extremal self-dual codes of length 36, and from a generalization of this recursive algorithm for the shadow. The classification of -extremal codes permits to achieve the classification of all -extremal codes with d=6.
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 · Finite Group Theory Research
