Abstract: In the present paper, we give Assmus--Mattson type theorems for codes and lattices. We show that a binary doubly even self-dual code of length 24m with minimum weight 4m provides a combinatorial 1-design and an even unimodular lattice of rank 24m with minimum norm 2m provides a spherical 3-design. We remark that some of such codes and lattices give t-designs for higher t. As a corollary, we give some restrictions on the weight enumerators of binary doubly even self-dual codes of length 24m with minimum weight 4m. Ternary and quaternary analogues are also given.
Recommendations
Cites work
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 1224949 (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?)
- A new proof of the Assmus-Mattson theorem for non-binary codes
- A self-dual even (96, 48, 16) code (Corresp.)
- An upper bound for self-dual codes
- An upper bound of the value of \(t\) of the support \(t\)-designs of extremal binary doubly even self-dual codes
- Bounds for coefficients of cusp forms and extremal lattices
- Doubly-even self-dual code of length 96
- Extremal binary self-dual codes
- Hahn Polynomials, Discrete Harmonics, andt-Designs
- Harmonic weight enumerators of nonbinary codes and MacWilliams identities
- Lattices and codes. A course partially based on lectures by Friedrich Hirzebruch
- New 5-designs
- New Binary Singly Even Self-Dual Codes
- On even unimodular extremal lattices
- On harmonic weight enumerators of binary codes
- On self-dual doubly-even extremal codes
- On the classification of integral even unimodular 24-dimensional quadratic forms
- On the nonexistence of extremal self-dual codes
- SHELLS OF SELFDUAL LATTICES VIEWED AS SPHERICAL DESIGNS
- Self-dual codes over GF(4)
- Spherical codes and designs
- The Magma algebra system. I: The user language
- The nonexistence of near-extremal formally self-dual codes
- The support designs of the triply even binary codes of length 48
- Upper bounds for modular forms, lattices, and codes
Cited in
(17)- Jacobi polynomials and design theory I
- Harmonic Tutte polynomials of matroids
- An Assmus-Mattson theorem for codes over commutative association schemes
- New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
- On extremal and near-extremal self-dual ternary codes
- On the support \(t\)-designs of extremal Type III and IV codes
- Jacobi polynomials and harmonic weight enumerators of the first-order Reed–Muller codes and the extended Hamming codes
- A note on the Assmus-Mattson theorem for some binary codes. II
- Exceptional designs in some extended quadratic residue codes
- Jacobi polynomials and design theory. II
- A strengthening of the Assmus-Mattson theorem
- On the classification of skew Hadamard matrices of order 36 and related structures
- A note on the Assmus-Mattson theorem for some binary codes
- On the Assmus--Mattson type theorem for Type I and even formally self-dual codes
- A note on \(t\)-designs in isodual codes
- Some restrictions on the weight enumerators of near-extremal ternary self-dual codes and quaternary Hermitian self-dual codes
- Jacobi polynomials for the first-order generalized Reed-Muller codes
This page was built for publication: A note on Assmus-Mattson type theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831173)
