On the covering radius of ternary extremal self-dual codes

Masaaki Harada, Michio Ozeki, Kenichiro Tanabe

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

In this paper, we investigate the covering radius of ternary extremal self-dual codes. The covering radii of all ternary extremal self-dual codes of lengths up to 20 were previously known. The complete coset weight distributions of the two inequivalent extremal self-dual codes of length 24 are determined. As a consequence, it is shown that every extremal ternary self-dual code of length up to 24 has covering radius which meets the Delsarte bound. The first example of a ternary extremal self-dual code with covering radius which does not meet the Delsarte bound is also found. It is worth mentioning that the found code is of length 32.

Original languageEnglish
Pages (from-to)149-158
Number of pages10
JournalDesigns, Codes, and Cryptography
Volume33
Issue number2
DOIs
Publication statusPublished - 2004 Sep
Externally publishedYes

Keywords

  • Covering Radius
  • Self-dual Code
  • Ternary Code

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'On the covering radius of ternary extremal self-dual codes'. Together they form a unique fingerprint.

Cite this