On Rueppel's Linear Complexity Conjecture

Graham H. Norton

Rueppel's conjecture on the linear complexity of the first $n$ terms of the sequence $(1,1,0,1,0^3,1,0^7,1,0^{15},\dots )$ was first proved by Dai using the Euclidean algorithm. We…