Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Figures of merit for digital multistep pseudorandom numbers

Authors: Debra A. André, Gary L. Mullen and Harald Niederreiter
Journal: Math. Comp. 54 (1990), 737-748
MSC: Primary 65C10
MathSciNet review: 1011436
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The statistical independence properties of s successive digital multistep pseudorandom numbers are governed by the figure of merit ${\rho ^{(s)}}(f)$ which depends on s and the characteristic polynomial f of the recursion used in the generation procedure. We extend previous work for s = 2 and describe how to obtain large figures of merit for $s > 2$, thus arriving at digital multistep pseudorandom numbers with attractive statistical independence properties. Tables of figures of merit for $s = 3,4,5$ and degrees $\leq 32$ are included.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65C10

Retrieve articles in all journals with MSC: 65C10

Additional Information

Article copyright: © Copyright 1990 American Mathematical Society