Introduction to finite fields and their applications
Introduction to finite fields and their applications
A guide to simulation (2nd ed.)
A guide to simulation (2nd ed.)
Efficient and portable combined random number generators
Communications of the ACM
A tutorial on uniform variate generation
WSC '89 Proceedings of the 21st conference on Winter simulation
Communications of the ACM - Special issue on simulation
On improving pseudo-random number generators
WSC '91 Proceedings of the 23rd conference on Winter simulation
Combining random number generators
WSC '91 Proceedings of the 23rd conference on Winter simulation
Linear congruential generators of order K1
WSC '88 Proceedings of the 20th conference on Winter simulation
Coding the Lehmer pseudo-random number generator
Communications of the ACM
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Shift Register Sequences
| Hi-index | 0.00 |
We study a general class of random number generators which includes Lehmer's congruential generator and the Tausworthe shift-register generator as special cases. The generators in this class use a general linear recurrence relation defined by a primitive polynomial over a large finite field. This generator, like the Tausworthe generator, has the property of the k-space equi-distribution. We give some theoretical and heuristic justification for its asymptotic uniformity as well as asymptotic independence from a statistical theory viewpoint. In this paper, we also propose an efficient method of finding primitive polynomials in a large finite field. Several generators with extremely long cycles are presented.