A note on the Assmus-Mattson theorem for some binary codes. II

DOI10.1007/s10623-023-01212-warXiv2208.09077OpenAlexW4362588737WikidataQ122168135 ScholiaQ122168135MaRDI QIDQ6101278

Eiichi Bannai, Tsuyoshi Miezaki, Hiroyuki Nakasora

Publication date: 20 June 2023

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

Full work available at URL: https://arxiv.org/abs/2208.09077

zbMATH Keywords

Assmus-Mattson theorem\(t\)-designsharmonic weight enumerator

Mathematics Subject Classification ID

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 ⋮ Jacobi polynomials and design theory. II

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
• The Magma algebra system. I: The user language
• On harmonic weight enumerators of binary codes
• On the support designs of extremal binary doubly even self-dual codes
• The vanishing of Ramanujan's function \(\tau(n)\)
• A note on the Assmus-Mattson theorem for some 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

This page was built for publication: A note on the Assmus-Mattson theorem for some binary codes. II