I'm reading the Thompson's book about lattices and sphere packing and got stuck by a sentence of a kind of $Z_8$ he introduced to reach 2 pages later the full $E_8$ lattice. You can find this lattice defined at pages 73-74 and it's basically. To resume it, it's a lattice packing with 16 closest point to the origin having shape: $$(\pm2, 0^7)$$ The packing radius is then $1/2$ of their distance from the origin, i.e. $\rho=1$. So far, so good.
My problem is when he tries to compute the center density of the lattice. Notice this center density can be interpreted as the "real" sphere center density since $\rho=1$, as claimed in SPLAG when describing the formula for $\delta$.
Instead of using any formula, Thompson uses a clever idea to estimate it, which sound like this:
The center density is fairly easy to calculate. If all coordinate entries were written in binary form, then the lattice, by definition, would contain only those coordinates whose ones digits were either all 0's or 1's. In this case the only two out of every $2^8$ points with integer coordinates are acceptable. Thus, the center density = $1/2^7$
I've got 2 problems with this result.
The first is I can choose for this lattice a generating matrix made by only 2 in all diagonal entries, i.e. twice the identity matrix. The determinant of this would then $2^8$. Using SPLAG formula for center density, and keeping $\rho=1$, I would get $\delta=1/2^8$, which is smaller by a factor of 2 compared to the one claimed by Thompson.
To confirm this latest sentence: as far as I can see, the lattice defined above can be seen as $Z_8$ lattice, which density is (always from SPLAG), $\delta=1/2^8$
However Thompson is using this $1/2^7$ to derive the full $E_8$ lattice, so I'm not claiming it's wrong a priori. But I'd like to understand where my reasoning is wrong and how to express coordinates in that binary format (I'm a programmer, so used to binary digits) to emulates Thompson's idea.
Thanks in advance
I think to have found the explanation of the binary trick. First of all, let's consider this lattice has all coordinates even or all odd, by definition. The idea was suggested to me in the way in which Leech enriched the extended Golay code $C_{24}$. Let's write a generic point stacking the binary digits in vertical (let's consider positive numbers up to 15 for the sake of simplicity and without loss of generality).
$$(5, 9, 1, 3, 1,....) = \begin{bmatrix}0 & 1 & 0 & 0 & 0 &...\\1 & 0 & 0 & 0 & 0 &...\\0 & 0 & 0 & 1 & 0 &...\\1 & 1 & 1 & 1 & 1 &...\end{bmatrix}$$
, where the top row is the 8s digit while the bottom row is the 1s digit.
It's easy to see, for the case of 8 coordinates like for this lattice, the bottom row will be made by these couple of octuplets ONLY: $(0, 0, 0, 0, 0, 0, 0, 0)$ and $(1, 1, 1, 1, 1, 1, 1, 1)$. This is because we have claimed above the coordinates for this lattice are all odd or all even. If we consider 8 generic integer coordinates, it's easy to see the bottom row could span from all 0's to all 1's, passing through all the $2^8=256$ possibilities. As claimed by the book author, then, the density will be the ratio of the couple combinations over the overall possible ones, i.e. $\delta=\frac{2}{2^8}=\frac{1}{2^7}$. It's easy to extend this proof encompassing integral numbers > 15 (so having any kind of row numbers) and negative (considering a kind of 2-complement representation $-6=2(mod 8)$, like Leech did). Finally, we can use the same trick to estimate quickly the center density of the $D_4$ checkerboard lattice (i.e. the densest packing in 4 dimensions), which has the same property of having all coordinates even or all odd. Here we will have 4 coordinates to be represented in binary form, which forms an overall $2^4$ possible combinations for their 1s digit. But only the $(0, 0, 0, 0)$ and $(1, 1, 1, 1)$ out of them will host the $D_4$ lattice points, which nails the center density to $\delta=\frac{2}{2^4}=\frac{1}{8}$. This matches exactly the center density enumerated in SPLAG 1.2 Table pag.15.