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

DOI10.1007/s10623-014-0033-7zbMath1361.94055OpenAlexW1969611510MaRDI QIDQ264124

Tsuyoshi Miezaki, Hiroyuki Nakasora

Publication date: 5 April 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-014-0033-7

zbMATH Keywords

Assmus-Mattson theorem\(t\)-designsself-dual codesharmonic weight enumerators

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05)

Related Items (7)

Design-theoretic analogies between codes, lattices, and vertex operator algebras ⋮ A note on Assmus-Mattson type theorems ⋮ A note on the Assmus-Mattson theorem for some binary codes ⋮ Harmonic Tutte polynomials of matroids ⋮ A note on the Assmus-Mattson theorem for some binary codes. II ⋮ Jacobi polynomials and design theory. II ⋮ An Assmus-Mattson theorem for codes over commutative association schemes

Cites Work

• Unnamed Item
• Erratum to: ``On the support designs of extremal binary doubly even self-dual codes
• Extending t-designs
• Upper bounds for modular forms, lattices, and codes
• On the nonexistence of extremal self-dual codes
• On harmonic weight enumerators of binary codes
• On the support designs of extremal binary doubly even self-dual codes
• A strengthening of the Assmus-Mattson theorem
• Overlap and Covering Polynomials with Applications to Designs and Self-Dual Codes
• New 5-designs
• Hahn Polynomials, Discrete Harmonics, andt-Designs

This page was built for publication: An upper bound of the value of \(t\) of the support \(t\)-designs of extremal binary doubly even self-dual codes