A large class of nonlinear shift register sequences (Corresp.)
Farhad Hemmati · IEEE Transactions on Information Theory · 1982
The cycle structure of a binary linear shift register with connection polynomialG(x)=(1+x)^{2}g(x), whereg(x)is a primitive polynomial of degreem-2over GF(2), is used to give several construction techniques for generation of shift-register sequences of lengthl=2^{m}-4. It is shown that a class of nonlinear deBruijn cycles, where the number of elements is proportional to2^{5m}, can be constructed. The obtained cycles can be generated by simplem-stage nonlinear feedback shift registers.