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-7MaRDI QIDQ264124zbMATH OpenOpenAlexFDO

Authors 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

\(t\)-designsAssmus-Mattson theoremharmonic weight enumeratorsself-dual codes

Mathematics Subject Classification ID

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

Recommendations

• On the support designs of extremal binary doubly even self-dual codes
• On self-dual doubly-even extremal codes
• Coding and Cryptography
• On a 5-design related to a putative extremal doubly even self-dual code of length a multiple of 24
• A characterization of designs related to an extremal doubly-even self-dual code of length 48

Cites work

• scientific article; zbMATH DE number 5182595 (Why is no real title available?)
• A strengthening of the Assmus-Mattson theorem
• Erratum to: ``On the support designs of extremal binary doubly even self-dual codes
• Extending t-designs
• Hahn Polynomials, Discrete Harmonics, andt-Designs
• New 5-designs
• On harmonic weight enumerators of binary codes
• On the nonexistence of extremal self-dual codes
• On the support designs of extremal binary doubly even self-dual codes
• Overlap and Covering Polynomials with Applications to Designs and Self-Dual Codes
• Upper bounds for modular forms, lattices, and codes

Cited in

(12)

• A note on Assmus-Mattson type theorems
• Design-theoretic analogies between codes, lattices, and vertex operator algebras
• Mutually disjoint \(t\)-designs and \(t\)-SEEDs from extremal doubly-even self-dual codes
• On self-dual doubly-even extremal codes
• Harmonic Tutte polynomials of matroids
• A note on the Assmus-Mattson theorem for some binary codes. II
• On the support \(t\)-designs of extremal Type III and IV codes
• Jacobi polynomials and design theory. II
• On the support designs of extremal binary doubly even self-dual codes
• A note on the Assmus-Mattson theorem for some binary codes
• An Assmus-Mattson theorem for codes over commutative association schemes
• The support designs of the triply even binary codes of length 48

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264124)