An upper bound of the value of t of the support t-designs of extremal binary doubly even self-dual codes
From MaRDI portal
Publication:264124
DOI10.1007/S10623-014-0033-7zbMATH Open1361.94055OpenAlexW1969611510MaRDI QIDQ264124FDOQ264124
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
Cites Work
- On the nonexistence of extremal self-dual codes
- New 5-designs
- Extending t-designs
- Upper bounds for modular forms, lattices, and 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
- Erratum to: ``On the support designs of extremal binary doubly even self-dual codes
- Overlap and Covering Polynomials with Applications to Designs and Self-Dual Codes
- Title not available (Why is that?)
- Hahn Polynomials, Discrete Harmonics, andt-Designs
Cited In (9)
- 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
- 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
- A note on the Assmus-Mattson theorem for some binary codes
- An Assmus-Mattson theorem for codes over commutative association schemes
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)
