Abstract
We construct extremal singly even self-dual [64,32,12] codes with weight enumerators which were not known to be attainable. In particular, we find some codes whose shadows have minimum weight 12. By considering their doubly even neighbors, extremal doubly even self-dual [64,32,12] codes with covering radius 12 are constructed for the first time.
Original language | English |
---|---|
Pages (from-to) | 93-101 |
Number of pages | 9 |
Journal | Designs, Codes, and Cryptography |
Volume | 42 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2007 Jan |
Externally published | Yes |
Keywords
- Covering radius
- Extremal self-dual code
- Neighbor
ASJC Scopus subject areas
- Computer Science Applications
- Applied Mathematics