A note on the Assmus-Mattson theorem for some binary codes
From MaRDI portal
Publication:2672304
DOI10.1007/s10623-022-01050-2zbMath1501.94095arXiv2004.03396OpenAlexW4229458202WikidataQ113903985 ScholiaQ113903985MaRDI QIDQ2672304
Tsuyoshi Miezaki, Hiroyuki Nakasora
Publication date: 8 June 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.03396
Combinatorial aspects of block designs (05B05) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Linear codes (general theory) (94B05)
Related Items (2)
A note on the Assmus-Mattson theorem for some binary codes. II ⋮ Jacobi polynomials and design theory. II
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An upper bound of the value of \(t\) of the support \(t\)-designs of extremal binary doubly even self-dual codes
- Conformal designs and D.H. Lehmer's conjecture
- Design-theoretic analogies between codes, lattices, and vertex operator algebras
- A note on Assmus-Mattson type theorems
- On even unimodular extremal lattices
- Extending t-designs
- On harmonic weight enumerators of binary codes
- On the support designs of extremal binary doubly even self-dual codes
- Conformal designs based on vertex operator algebras
- The vanishing of Ramanujan's function \(\tau(n)\)
- On triply even binary codes
- An elementary approach to toy models for D. H. Lehmer's conjecture
- The support designs of the triply even binary codes of length 48
- Toy Models for D. H. Lehmer’s Conjecture II
- New 5-designs
- Hahn Polynomials, Discrete Harmonics, andt-Designs
- Toy models for D. H. Lehmer's conjecture
- A note on the Assmus-Mattson theorem for some binary codes. II
This page was built for publication: A note on the Assmus-Mattson theorem for some binary codes
