By Topic

The number of cross-join pairs in maximum length linear sequences

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)
Helleseth, T. ; Dept. of Inf., Bergen Univ., Norway ; Klove, T.

It has been conjectured by T. Chang et al. (1990) that the number of cross-join pairs in a maximum length linear sequence equals (2n-1-1)(2n-1-2)/6. A maximum length linear sequence (an m-sequence) of length 2n-1 is a binary sequence which satisfies a linear recurrence whose characteristic polynomial is primitive of degree n. The number of primitive polynomials is given by φ(2n-1)/n, where φ is Euler's φ-function. A proof of the conjecture is given

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 6 )