Commutative association schemes
European Journal of Combinatorics
Finite Fields and Their Applications
MDS Self-Dual Codes over Large Prime Fields
Finite Fields and Their Applications
On the Hamming Weight Enumerators of Self-Dual Codes over Zk
Finite Fields and Their Applications
On some new m-spotty Lee weight enumerators
Designs, Codes and Cryptography
| Hi-index | 754.84 |
Gleason has recently shown that the weight enumerators of binary and ternary self-dual codes are polynomials in two given polynomials. In this paper it is shown that classical invariant theory permits a straightforward and systematic proof of Gleason's theorems and their generalizations. The joint weight enumerator of two codes (analogous to the joint density function of two random variables) is defined and shown to satisfy a MacWilliams theorem. Invariant theory is then applied to generalize Gleason's theorem to the complete weight enumerator of self-dual codes overGF(3), the Lee metric enumerator overGF(5)(given by Klein in 1884!) and overGF(7)(given by Maschke in 1893!), the Hamming enumerator overGF(q), and overGF(4)with all weights divisible by 2, the joint enumerator of two self-dual codes overGF(2), and a number of other results.