One of the most remarkable and beautiful theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes and their connections with invariant theory, which has inspired hundreds of papers about generalizations and applications of this theorem to different types of codes. This self-contained book develops a new theory which is powerful enough to include all the earlier generalizations.

We now apply the algorithm above to find the 121 orbits of norm -2 vectors from the (known) nann 0 vectors, and then apply it again to find the 665 orbits of nann -4 vectors from the vectors of nann 0 and -2. The neighbors of a strictly 24 dimensional odd unimodular lattice can be found as follows. If a norm -4 vector v E II . corresponds to the sum 25 1 of a strictly 24 dimensional odd unimodular lattice A and a -dimensional lattice, then there are exactly two nonn-0 vectors of ll25,1 having inner product -2 with v, and these nann 0 vectors correspond to the two even neighbors of A. The...