Repeated-root cyclic code

A repeated-root cyclic code has length divisible by the characteristic of its field, so the polynomial $X^N-1$ has repeated factors. Its generator can involve powers of those factors. In characteristic two, length $2^t$ gives $X^{2^t}+1=(X+1{)}^{2^t}$.

// Target: algebra.bigb