On the Periods of Generalized Fibonacci Recurrences
Open Access
- 1 July 1994
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 63 (207) , 389-401
- https://doi.org/10.2307/2153583
Abstract
We give a simple condition for a linear recurrence <!-- MATH $\pmod {2^w}$ --> of degree r to have the maximal possible period <!-- MATH ${2^{w - 1}}({2^r} - 1)$ --> . It follows that the period is maximal in the cases of interest for pseudorandom number generation, i.e., for three-term linear recurrences defined by trinomials which are primitive and of degree 2$">. We consider the enumeration of certain exceptional polynomials which do not give maximal period, and list all such polynomials of degree less than 15.
Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Shift Register SequencesPublished by World Scientific Pub Co Pte Ltd ,2014
- Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497Mathematics of Computation, 1991
- A review of pseudorandom number generatorsComputer Physics Communications, 1990
- Random Number Generators on Vector Supercomputers and Other Advanced ArchitecturesSIAM Review, 1990
- Matrices and the structure of random number sequencesLinear Algebra and its Applications, 1985
- Error-Free Polynomial Matrix ComputationsPublished by Springer Nature ,1985
- On computing reciprocals of power seriesNumerische Mathematik, 1974
- Primitive Binary PolynomialsMathematics of Computation, 1973
- Primitive Trinomials of High DegreeMathematics of Computation, 1968
- Empirical Tests of an Additive Random Number GeneratorJournal of the ACM, 1959