The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number Generators
Journal of the ACM (JACM)
Generalized Feedback Shift Register Pseudorandom Number Algorithm
Journal of the ACM (JACM)
An Asymptotically Random Tausworthe Sequence
Journal of the ACM (JACM)
Partitioning the Period of a Class of m-Sequences and Application to Pseudorandom Number Generation
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Orderly enumeration of nonsingular binary matrices applied to text encryption
Communications of the ACM
Encyclopedia of Computer Science
Encyclopedia of Computer Science
Shift Register Sequences
The orders of equidistribution of subsequences of some asymptotically random sequences
Communications of the ACM
Walsh-spectral test for GFSR pseudorandom numbers
Communications of the ACM
On the discrepancy of GFSR pseudorandom numbers
Journal of the ACM (JACM)
Efficient and portable combined random number generators
Communications of the ACM
Communications of the ACM - Special issue on simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Uniform random number generators: a review
Proceedings of the 29th conference on Winter simulation
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Uniform random number generators
Proceedings of the 30th conference on Winter simulation
Neave effect also occurs with Tausworthe sequences
WSC '91 Proceedings of the 23rd conference on Winter simulation
Lattice structure of pseudorandom sequences from shift-register generators
WSC' 90 Proceedings of the 22nd conference on Winter simulation
Random number generation with primitive pentanomials
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Software for uniform random number generation: distinguishing the good and the bad
Proceedings of the 33nd conference on Winter simulation
Combined random number generator via the generalized Chinese remainder theorem
Journal of Computational and Applied Mathematics
On the xorshift random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Improved long-period generators based on linear recurrences modulo 2
ACM Transactions on Mathematical Software (TOMS)
High Quality Uniform Random Number Generation Using LUT Optimised State-transition Matrices
Journal of VLSI Signal Processing Systems
Resolution-stationary random number generators
Mathematics and Computers in Simulation
Hi-index | 48.27 |
A necessary and sufficient condition is established for the generalized feedback shift register (GFSR) sequence introduced by Lewis and Payne to be k-distributed. Based upon the theorem, a theoretical test for k-distributivity is proposed and performed in a reasonable amount of computer time, even for k = 16 and a high degree of resolution (for which statistical tests are impossible because of the astronomical amount of computer time required). For the special class of GFSR generators considered by Arvillias and Maritsas based on the primitive trinomial Dp + Dq + 1 with q = an integral power of 2, it is shown that the sequence is k-distributed if and only if the lengths of all subregisters are at least k. The theorem also leads to a simple and efficient method of initializing the GFSR generator so that the sequence to be generated is k-distributed.