Codes and Invariant Theory
Gabriele Nebe, E. M. Rains, N. J. A. Sloane
Abstract
The main theorem in this paper is a far-reaching generalization of Gleason's theorem on the weight enumerators of codes which applies to arbitrary-genus weight enumerators of self-dual codes defined over a large class of finite rings and modules. The proof of the theorem uses a categorical approach, and will be the subject of a forthcoming book. However, the theorem can be stated and applied without using category theory, and we illustrate it here by applying it to generalized doubly-even codes over fields of characteristic 2, doubly-even codes over the integers modulo a power of 2, and self-dual codes over the noncommutative ring q + q u, where u2 = 0..
Create a lesson
Related papers
Unit fraction representations using shifted Golomb primes
Rishika Agrawal
Improved deterministic integer factorization by quadratic-image sieving
Pantelimon Stănică
Private key sieves for improved attacks on RSA
Markus Hittmeir
Multiple q-zeta values as polynomials in partition multiplicities
Jan-Willem M. van Ittersum
Hopf-Galois Structures on Extensions Arising from Division Points on Elliptic Curves
Leolin Nkuete
Certified Collision Exclusion and an Unconditional Upper Bound Λ<0.156821 for the de Bruijn--Newman Constant
Michel Planat, Dale James Raymond