Higher weights and graded rings for binary self-dual codes (Q1811098)

The theory of higher weights, which is a generalization of the Hamming weight, is applied to binary self-dual codes. Bounds are derived for the second minimum higher weight and a Gleason-type theorem is obtained for the second higher weight enumerator. The second weight enumerator is shown to be unique for the putative Type II code, and the first three minimum weights are computed for optimal codes of length less than 32. The authors also determine the structures of the graded rings associated with the code polynomials of higher weights for small genera.