On harmonic weight enumerators of binary codes
In the study of Euclidean spherical codes and the classification of certain types of lattices, B.~B.~Venkov has successfully applied theta series whose coefficients are spherical harmonics. In the present paper the author develops the analogous idea of weight enumerators with harmonic coefficients for binary linear codes. After introducing this generalization of the ordinary weight enumerator, she proves a MacWilliams type theorem and, in the case of (formally) even self-dual codes, she determines appropriate spaces of relative invariants for the specific transformation groups of order 16 and 196. As a first application, the Assmus-Mattson theorem and its strengthenings by Calderbank, Delsarte and Sloane are recovered. Next, by specializing to discrete harmonics given by Hahn polynomials, the author gets information on so-called intersection numbers of a code, counting in general how many codewords of given weight intersect a given set of positions in a given number of elements. Finally this information is applied to the classification of extremal even formally self-dual codes of length 12 (which give rise to 12-dimensional isodual lattices having the same ordinary theta series as the unique indecomposable self-dual Kneser lattice).
- Weighted generating functions for type II lattices and codes
- Generalizations of Gleason's theorem on weight enumerators of self-dual codes
- Harmonic weight enumerators of nonbinary codes and MacWilliams identities
- Configurations of extremal type II codes via harmonic weight enumerators
- Weight and distance enumerators of codes and sphere packings.
- New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
- A survey on spherical designs and algebraic combinatorics on spheres
- Commutative association schemes
- Designs and self-dual codes with long shadows.
- An Assmus-Mattson theorem for codes over commutative association schemes
- Extremal self-dual \([40,20,8]\) codes with covering radius 7
- Codes and Siegel modular forms
- A shadow identity and an application to isoduality.
- On involutions in extremal self-dual codes and the dual distance of semi self-dual codes
- Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless
- Configurations of extremal type II codes via harmonic weight enumerators
- Construction of isodual codes over \(\mathrm{GF}(q)\)
- Conformal designs based on vertex operator algebras
- Support weight enumerators and coset weight distributions of isodual codes
- An upper bound of the value of t of the support t-designs of extremal binary doubly even self-dual codes
- A note on the Assmus-Mattson theorem for some binary codes
- Covering polynomials and projections of self-dual codes
- Harmonic weight enumerators of nonbinary codes and MacWilliams identities
- Weight and distance enumerators of codes and sphere packings.
- An Assmus-Mattson theorem for rank metric codes
- Weighted generating functions for type II lattices and codes
- Harmonic distributions for equitable partitions of a hypercube
- On the classification and enumeration of self-dual codes
- On the classification of extremal even formally self-dual codes of lengths 20 and 22
- Harmonic Tutte polynomials of matroids
- Weighted Tutte-Grothendieck polynomials of graphs
- Exceptional designs in some extended quadratic residue codes
- A note on the Assmus-Mattson theorem for some binary codes. II
- A note on t-designs in isodual codes
- Jacobi polynomials and harmonic weight enumerators of the first-order Reed–Muller codes and the extended Hamming codes
- On the support \(t\)-designs of extremal Type III and IV codes
- Harmonic higher and extended weight enumerators
- A note on the Assmus-Mattson theorem for some ternary codes
- Design-theoretic analogies between codes, lattices, and vertex operator algebras
- A note on Assmus-Mattson type theorems
- Kneser-Hecke-operators in coding theory
This page was built for publication: On harmonic weight enumerators of binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1591644)
