= Circular autocorrelation of the binary Golay generator
The polynomial identity $(X+1)g(X)g^{\mathrm{rev}}(X)=X^{23}+1$, where $g^{\mathrm{rev}}(X)=X^{11}g(X^{-1})$, implies
$$
g(X)g(X^{-1})\equiv1+X+\cdots+X^{22}\pmod{X^{23}-1}.
$$
Every coefficient is the binary <inner product> of the coefficient vector of $g$ with one cyclic shift. Thus every such <inner product> is one. Appending a parity bit to the cyclic shifts gives mutually orthogonal weight-eight vectors, so <orthogonal generators of doubly even codes> applies.
// Target: algebra.bigb
Back to article page
