I'm reading a paper by N.J.A Sloane on self dual codes, and he introduces the binary Hamming code of length $8$ with generator matrix $$ G = \begin{bmatrix} 1&1&1&1&1&1&1&1\\ 0&1&1&1&0&1&0&0\\ 0&0&1&1&1&0&1&0\\ 0&0&0&1&1&1&0&1 \end{bmatrix}$$
Where if we assign labels to the columns from left to right; $\infty, 0,1,2,3,4,5,6$, then the second row has $1's$ where the column is labelled by a quadratic residue mod $7$. Then we cyclic shift to get the remaining rows.
What is being done here? I assume we just ignore the first row and first column as this just extends the matrix. I've looked in to quadratic residue codes but I can't seem to find the link between them and this generator matrix? Could anyone explain what's being done here?
The paper I'm referring to can be found here; https://arxiv.org/abs/math/0612535.