Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Interlacing properties of shift-register sequences with generator polynomials irreducible over GF(p) (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

2 Author(s)

Interlacing properties of shift-register sequences with generator polynomials irreducible over GF (p) -herein called elementary sequences--are analyzed. The most important elementary sequences are maximal-length sequences ( m -sequences). If the period q of an elementary sequence is not prime, the sequence can always be constructed by interlacing shorter elementary sequences of period q_{i} , provided q_{i} divides q . It is proved that all interlaced elementary sequences are generated by one and the same irreducible polynomial. Some relationships between equal-length elementary sequences are derived, including some rather unexpected crosscorrelation properties. As an example of an application of the theory, a new time-division multiplex technique for generating high-speed m -sequences is presented.

Published in:

Information Theory, IEEE Transactions on  (Volume:24 ,  Issue: 3 )