An upper bound of the value of t of the support t-designs of extremal binary doubly even self-dual codes

Tsuyoshi Miezaki*, Hiroyuki Nakasora

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

Let (Formula presented.) be an extremal binary doubly even self-dual code of length (Formula presented.) and (Formula presented.) be the support design of (Formula presented.) for a weight (Formula presented.). We introduce the two numbers (Formula presented.) and (Formula presented.) : (Formula presented.) is the largest integer (Formula presented.) such that, for all wight, (Formula presented.) is a (Formula presented.) -design; (Formula presented.) denotes the largest integer (Formula presented.) such that there exists a (Formula presented.) such that (Formula presented.) is a (Formula presented.) -design. In this paper, we consider the possible values of (Formula presented.) and (Formula presented.).

Original languageEnglish
Pages (from-to)37-46
Number of pages10
JournalDesigns, Codes, and Cryptography
Volume79
Issue number1
DOIs
Publication statusPublished - 2016 Apr 1
Externally publishedYes

Keywords

  • Assmus–Mattson theorem
  • Harmonic weight enumerators
  • Self-dual codes
  • t-Designs

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'An upper bound of the value of t of the support t-designs of extremal binary doubly even self-dual codes'. Together they form a unique fingerprint.

Cite this