By Topic

On the linear span of binary sequences obtained from q-ary m-sequences, q odd

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
$33 $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)
A. H. Chan ; Mitre Corp., Bedford, MA, USA ; R. A. Games

A class of periodic binary sequences that are obtained from q -ary m-sequences is defined, and a general method to determine their linear spans (the length of the shortest linear recursion over the Galois field GF(2) satisfied by the sequence) is described. The results imply that the binary sequences under consideration have linear spans that are comparable with their periods, which can be made very long. One application of the results shows that the projective and affine hyperplane sequences of odd order both have full linear span. Another application involves the parity sequence of order n, which has period pm-1, where p is an odd prime. The linear span of a parity sequence of order n is determined in terms of the linear span of a parity sequence of order 1, and this leads to an interesting open problem involving primes

Published in:

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