Periodic binary sequences: solved and unsolved problems

  • Authors:
  • Solomon W. Golomb

  • Affiliations:
  • University of Southern California

  • Venue:
  • SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

The binary linear feedback shift register sequences of degree n and maximum period p = 2n - 1 (the m-sequences) are useful in numerous applications because, although deterministic, they satisfy a number of interesting "randomness properties". An important open question is whether a binary sequence of period p = 2n - 1 with both the span-n property and the two-level correlation property must be an m-sequence. There is a direct correspondence between m-sequences of degree n and primitive polynomials of degree n over GF(2). Several conjectures are presented about primitive polynomials with a bounded number of terms.