Extremal self-dual codes with the smallest covering radius

Masaaki Harada, Michio Ozeki

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

In this note, an extremal doubly-even [40, 20, 8] code with covering radius 7 is given. This code is the first extremal doubly-even code whose covering radius does not meet the Delsarte bound. Extremal singly-even codes with the smallest covering radius are also given. One of them is an extremal singly-even [44, 22, 8] code with covering radius 7, which determines t[43, 22] = 6 by puncturing.

Original languageEnglish
Pages (from-to)271-281
Number of pages11
JournalDiscrete Mathematics
Volume215
Issue number1-3
DOIs
Publication statusPublished - 2000 Mar 28
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Extremal self-dual codes with the smallest covering radius'. Together they form a unique fingerprint.

Cite this