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

DOI10.1007/S10623-022-01050-2MaRDI QIDQ2672304zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

\(t\)-designAssmus-Mattson theoremharmonic 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)

Abstract: We previously proposed the first nontrivial examples of a code having support $t$-designs for all weights obtained from the Assmus-Mattson theorem and having support $t^{\prime }$-designs for some weights with some $t^{\prime }>t$. This suggests the possibility of generalizing the Assmus-Mattson theorem, which is very important in design and coding theory. In the present paper, we generalize this example as a strengthening of the Assmus-Mattson theorem along this direction. As a corollary, we provide a new characterization of the extended Golay code $mathcal{G}_{24}$.

Review text

The classical Assmus-Mattson theorem [\textit{E. F. Assmus jun.} and \textit{H. F. Mattson jun.}, J. Comb. Theory 6, 122--151 (1969; Zbl 0179.02901] is a famous result that relates linear codes and combinatorial designs. In particular, it shows that if the dual of a given code has few nonzero weights in an interval, then the supports of codewords of fixed Hamming weight close enough to the minimum distance of the code form the blocks of a design. In this paper, the authors discuss a generalization of the Assmus-Mattson theorem for certain binary codes, and provide a new characterization of the extended Golay code \(\mathcal{G}_{24}\).

Recommendations

• A strengthening of the Assmus-Mattson theorem
• An Assmus-Mattson theorem for Z/sub 4/-codes
• A new proof of the Assmus-Mattson theorem for non-binary codes
• A note on Assmus-Mattson type theorems
• A criterion for designs in \({\mathbb Z}_4\)-codes on the symmetrized weight enumerator

Cites work

• A note on Assmus-Mattson type theorems
• A note on the Assmus-Mattson theorem for some binary codes. II
• An elementary approach to toy models for D. H. Lehmer's conjecture
• 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
• Conformal designs based on vertex operator algebras
• Design-theoretic analogies between codes, lattices, and vertex operator algebras
• Extending t-designs
• Hahn Polynomials, Discrete Harmonics, andt-Designs
• scientific article; zbMATH DE number 50655 (Why is no real title available?)
• scientific article; zbMATH DE number 2140363 (Why is no real title available?)
• scientific article; zbMATH DE number 5182595 (Why is no real title available?)
• New 5-designs
• On even unimodular extremal lattices
• On harmonic weight enumerators of binary codes
• On the support designs of extremal binary doubly even self-dual codes
• On triply even binary codes
• The support designs of the triply even binary codes of length 48
• The vanishing of Ramanujan's function \(\tau(n)\)
• Toy models for D. H. Lehmer's conjecture
• Toy models for D. H. Lehmer's conjecture. II

Cited in

(13)

• A criterion for designs in \({\mathbb Z}_4\)-codes on the symmetrized weight enumerator
• An Assmus-Mattson theorem for codes over commutative association schemes
• A coding theoretic approach to extending designs
• Further remarks for the matrix type-B codes
• An Assmus-Mattson theorem for Z/sub 4/-codes
• The Asymptotic Number of Binary Codes and Binary Matroids
• A new proof of the Assmus-Mattson theorem for non-binary codes
• A note on the Assmus-Mattson theorem for some binary codes. II
• Jacobi polynomials and design theory. II
• On the Assmus--Mattson type theorem for Type I and even formally self-dual codes
• On the support \(t\)-designs of extremal Type III and IV codes
• A note on the Assmus-Mattson theorem for some ternary codes
• A note on Assmus-Mattson type theorems

Describes a project that uses

Uses Software

• Mathematica

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

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