By Topic

A large class of nonlinear shift register sequences (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

The cycle structure of a binary linear shift register with connection polynomial G(x)=(1+x)^{2}g(x) , where g(x) is a primitive polynomial of degree m-2 over GF (2) , is used to give several construction techniques for generation of shift-register sequences of length l=2^{m}-4 . It is shown that a class of nonlinear deBruijn cycles, where the number of elements is proportional to 2^{5m} , can be constructed. The obtained cycles can be generated by simple m -stage nonlinear feedback shift registers.

Published in:

Information Theory, IEEE Transactions on  (Volume:28 ,  Issue: 2 )