Conjectured linear complexity of generalized cyclotomic binary sequences
Linear-complexity conjecture. If 2p−1≢1(modp2)2^{p-1}\not\equiv 1\pmod {p^2}2p−1≡1(modp2), then the linear complexity LLL of s∞s^\inftys∞ is
MathDB