Weight Enumerators of Double Circulant Codes and New Extremal Self-Dual Codes

T. Aaron Gulliver, Masaaki Harada

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

In this paper it is shown that the weight enumerator of a bordered double circulant self-dual code can be obtained from those of a pure double circulant self-dual code and its shadow through a relationship between bordered and pure double circulant codes. As applications, a restriction on the weight enumerators of some extremal double circulant codes is determined and a uniqueness proof of extremal double circulant self-dual codes of length 46 is given. New extremal singly-even [44, 22, 8] double circulant codes are constructed. These codes have weight enumerators for which extremal codes were not previously known to exist.

Original languageEnglish
Pages (from-to)141-150
Number of pages10
JournalDesigns, Codes, and Cryptography
Volume11
Issue number2
DOIs
Publication statusPublished - 1997 Jan 1
Externally publishedYes

Keywords

  • Double circulant codes
  • Extremal self-dual codes
  • Weight enumerators

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Weight Enumerators of Double Circulant Codes and New Extremal Self-Dual Codes'. Together they form a unique fingerprint.

  • Cite this