Figures of Merit for Digital Multistep Pseudorandom Numbers

DOI10.2307/2008509zbMath0699.65003OpenAlexW4239318276MaRDI QIDQ3477864

Harald Niederreiter, Gary L. Mullen, Debra A. André

Publication date: 1990

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2008509

zbMATH Keywords

characteristic polynomialstatistical independencefigure of meritdigital k-step pseudorandom numbersrecursive pseudorandom number generation

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Random number generation in numerical analysis (65C10)

Related Items

A comparative study of some pseudorandom number generators ⋮ Calculation of Fibonacci Polynomials for GFSR Sequences with Low Discrepancies ⋮ Recent trends in random number and random vector generation ⋮ Good Parameters for a Class of Node Sets in Quasi-Monte Carlo Integration ⋮ On the Use of Reducible Polynomials as Random Number Generators ⋮ Uniform random number generation ⋮ Low-discrepancy point sets obtained by digital constructions over finite fields