The Performance of k-Step Pseudorandom Number Generators under the Uniformity Test

DOI10.1137/0905057zbMath0557.65005OpenAlexW2013899469MaRDI QIDQ3221262

Harald Niederreiter

Publication date: 1984

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0905057

zbMATH Keywords

a priori boundsmethoduniform pseudorandom numbersuniformity testdigitalk-step linear recursions

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Related Items (6)

Rational functions with partial quotients of small degree in their continued fraction expansion ⋮ Statistical independence properties of pseudorandom vectors produced by matrix generators ⋮ Recent trends in random number and random vector generation ⋮ Further discrepancy bounds and an Erdös-Turán-Koksma inequality for hybrid sequences ⋮ Optimal characteristic polynomials for digital multistep pseudorandom numbers ⋮ Bounds on the discrepancy of linear recurring sequences over Galois rings

This page was built for publication: The Performance of k-Step Pseudorandom Number Generators under the Uniformity Test