Nonexistence of certain singly even self-dual codes with minimal shadow

Stefka Bouyuklieva, Masaaki Harada

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

It is known that there is no extremal singly even self-dual [n, n/2, d] code with minimal shadow for (n, d) = (24m+2, 4m+4), (24m+4, 4m+4), (24m+6, 4m+4), (24m + 10, 4m + 4) and (24m + 22, 4m + 6). In this paper, we study singly even self-dual codes with minimal shadow having minimum weight d − 2 for these (n, d). For n = 24m + 2, 24m + 4 and 24m + 10, we show that the weight enumerator of a singly even self-dual [n, n/2, 4m + 2] code with minimal shadow is uniquely determined and we also show that there is no singly even self-dual [n, n/2, 4m + 2] code with minimal shadow for m ≥ 155, m ≥ 156 and m ≥ 160, respectively. We demonstrate that the weight enumerator of a singly even self-dual code with minimal shadow is not uniquely determined for parameters [24m + 6, 12m + 3, 4m + 2] and [24m + 22, 12m + 11, 4m + 4].

Original languageEnglish
JournalElectronic Journal of Combinatorics
Volume25
Issue number1
DOIs
Publication statusPublished - 2018 Jan 25

Keywords

  • Self-dual code
  • Shadow
  • Weight enumerator

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Nonexistence of certain singly even self-dual codes with minimal shadow'. Together they form a unique fingerprint.

  • Cite this