Distributional properties of d-FCSR sequences

  • Authors:
  • Andrew Klapper

  • Affiliations:
  • Department of Computer Science, 779A Anderson Hall, University of Kentucky, Lexington, KY and Institute for Advanced Study, School of Mathematics

  • Venue:
  • Journal of Complexity - Special issue on coding and cryptography
  • Year:
  • 2004

Quantified Score

Hi-index 0.06

Visualization

Abstract

In this paper we study the distribution properties of d-FCSR sequences. These sequences, have efficient generators and have several good statistical properties. We show that for d = 2 the number of occurrences of an fixed size subsequence differs from the average number of occurrences by at most a small constant times the square root of the average.