Efficient and portable combined random number generators
Communications of the ACM
Testing random number generators
WSC '92 Proceedings of the 24th conference on Winter simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Recent advances in uniform random number generation
WSC '94 Proceedings of the 26th conference on Winter simulation
Inversive pseudorandom number generators: concepts, results and links
WSC '95 Proceedings of the 27th conference on Winter simulation
Maximally equidistributed combined Tausworthe generators
Mathematics of Computation
Distribution properties of multiply-with-carry random number generators
Mathematics of Computation
ACM Computing Surveys (CSUR)
Lamar: a new pseudorandom number generator evolved by means of genetic programming
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
On the combination of self-organized systems to generate pseudo-random numbers
Information Sciences: an International Journal
| Hi-index | 0.00 |
Empirical testing of computer generated pseudo-random sequences is widely practiced. Extensions to the coupon collector's and gap tests are presented that examine the distribution and independence of radix-b digit patterns in sequences with modulo of the form bw. An algorithm is given and the test is applied to a number of popular generators. Theoretical expected values are derived for a number of defects that may be present in a pseudorandom sequence and additional empirical evidence is given to support these values. The test has a simple model and a known distribution function. It is easily and efficiently implemented and easily adaptable to testing only the bits of interest, griven a certain application.