Extremal self-dual codes of length 64 through neighbors and covering radii

Naoki Chigira, Masaaki Harada, Masaaki Kitazume

Research output: Contribution to journalArticlepeer-review

14 Citations (Scopus)

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 languageEnglish
Pages (from-to)93-101
Number of pages9
JournalDesigns, Codes, and Cryptography
Volume42
Issue number1
DOIs
Publication statusPublished - 2007 Jan
Externally publishedYes

Keywords

  • Covering radius
  • Extremal self-dual code
  • Neighbor

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Extremal self-dual codes of length 64 through neighbors and covering radii'. Together they form a unique fingerprint.

Cite this