Hereโs the upper part of Kneserโs neighbourhood graph of the Niemeier lattices:

The Leech lattice has a unique neighbour, that is, among the remaining Niemeier lattices there is a unique one, , sharing an index two sub-lattice with the Leech.
How would you try to construct , an even unimodular lattice having the same roots as ?
The root lattice is . It has two roots , determinant , its dual lattice is and we have .
Thus, has roots, determinant , its dual lattice is and the quotient group is isomorphic to the additive subgroup of .
A larger lattice of index gives for the dual lattices an extension , also of index . If were unimodular, then the index has to be because we have the situation
So, Kneserโs glue vectors form a -dimensional subspace in , that is,
Because , the linear code must be self-dual meaning that (in ) for all . Further, we want that the roots of and are the same, so the minimal number of non-zero coordinates in must be .
That is, must be a self-dual binary code of length with Hamming distance .

Marcel Golay (1902-1989) โ Photo Credit
We now know that there is a unique such code, the (extended) binary Golay code, , which has
- one vector of weight
- vectors of weight (called โoctadsโ)
- vectors of weight (called โdodecadsโ)
- vectors of weight
- one vector of weight
The octads form a Steiner system (that is, for any -subset of the -coordinates there is a unique octad having its non-zero coordinates containing ).
Witt constructed a Steiner system in his 1938 paper โDie -fach transitiven Gruppen von Mathieuโ, so it is not unthinkable that he checked the subspace of spanned by his octads to be -dimensional and self-dual, thereby constructing the Niemeier-lattice on that sunday in 1940.
John Conway classified all nine self-dual codes of length in which the weight
of every codeword is a multiple of . Each one of these codes gives a Niemeier lattice , all but one of them having more roots than .
Vera Pless and Neil Sloan classified all binary self-dual codes of length .