Codes and invariant theory

✍ Scribed by G. Nebe; E. M. Rains; N. J. A. Sloane

• Publisher: John Wiley and Sons
• Year: 2004
• Tongue: English
• Weight: 202 KB
• Volume: 274-275
• Category: Article
• ISSN: 0025-584X
• DOI: 10.1002/mana.200310204

✦ Synopsis

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 ℤ/2^f^ℤ, and self‐dual codes over the noncommutative ring 𝔽~q~ + 𝔽~q~ u, where u^2^ = 0. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)