On Marsaglia's lattice test for pseudorandom numbers
From MaRDI portal
(Redirected from Publication:1114288)
Nonlinear recursive congruential pseudorandom number equations with prime modulus and maximal period length are considered. The authors give characterizations for these generator which behave optimally with respect to Marsaglia's lattice test.
Recommendations
- Marsaglia's lattice test and non-linear congruential pseudo-random number generators
- Remarks on nonlinear congruential pseudorandom numbers
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- The lattice structure of nonlinear congruential pseudorandom numbers
- On the statistical independence of nonlinear congruential pseudorandom numbers
Cites work
Cited in
(12)- Marsaglia's lattice test and non-linear congruential pseudo-random number generators
- Recent trends in random number and random vector generation
- A remark on the discrepancy of quadratic congruential pseudorandom numbers
- On the discrepancy of inversive congruential pseudorandom numbers with prime power modulus. II
- The Miller–Rabin test with randomized exponents
- Bit-Wise Behavior of Random Number Generators
- On the autocorrelation structure of inversive congruential pseudorandom number sequences
- Statistical Independence of a New Class of Inversive Congruential Pseudorandom Numbers
- Theory and application of Marsaglia's monkey test for pseudorandom number generators
- New modified scrambled Faure sequences
- Optimal Halton Sequence via Inversive Scrambling
- Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\)
This page was built for publication: On Marsaglia's lattice test for pseudorandom numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114288)