An Efficient Construction of Self-Dual Codes
Yoonjin Lee, Jon-Lark Kim

TL;DR
This paper advances the construction of self-dual codes over various rings and fields, producing numerous new codes with optimal or extremal properties, and contributes to the understanding of their applications in lattice theory.
Contribution
The paper completes the building-up construction for self-dual codes over specific rings and fields, and introduces extensions that generate many new extremal and optimal self-dual codes.
Findings
Constructed 945 new extremal self-dual ternary [32,16,9] codes
Generated many new self-dual codes over with lengths 12, 16, 20, minimum weight 6
Reconstructed optimal Type I lattices from codes over
Abstract
We complete the building-up construction for self-dual codes by resolving the open cases over with , and over and Galois rings with an odd prime satisfying with odd. We also extend the building-up construction for self-dual codes to finite chain rings. Our building-up construction produces many new interesting self-dual codes. In particular, we construct 945 new extremal self-dual ternary codes, each of which has a trivial automorphism group. We also obtain many new self-dual codes over of lengths all with minimum Hamming weight 6, which is the best possible minimum Hamming weight that free self-dual codes over of these lengths can attain. From the constructed codes over , we reconstruct optimal Type I lattices of dimensions and 24…
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 · Cellular Automata and Applications · graph theory and CDMA systems
