Near-extremal formally self-dual even codes of lengths 24 and 32

T. Aaron Gulliver, Masaaki Harada, Takuji Nishimura, Patric R.J. Östergård

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

The weight enumerator of a formally self-dual even code is obtained by the Gleason theorem. Recently, Kim and Pless gave some restrictions on the possible weight enumerators of near-extremal formally self-dual even codes of length divisible by eight. In this paper, the weight enumerators for which there is a near-extremal formally self-dual even code are completely determined for lengths 24 and 32, by constructing new near-extremal formally self-dual codes. We also give a classification of near- extremal double circulant codes of lengths 24 and 32.

Original languageEnglish
Pages (from-to)465-471
Number of pages7
JournalDesigns, Codes, and Cryptography
Volume37
Issue number3
DOIs
Publication statusPublished - 2005 Dec
Externally publishedYes

Keywords

  • Formally self-dual even codes
  • Weight enumerators

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Near-extremal formally self-dual even codes of lengths 24 and 32'. Together they form a unique fingerprint.

Cite this