Optimal characteristic polynomials for digital multistep pseudorandom numbers

G. L. Mullen; H. Niederreiter

doi:10.1007/BF02310104

Optimal characteristic polynomials for digital multistep pseudorandom numbers

G. L. Mullen, H. Niederreiter

Mathematics

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

Abstract

The digital multistep method generates uniform pseudorandom numbers by transforming sequences of integers obtained by multistep recursions. The statistical independence properties of these pseudorandom numbers depend on the characteristic polynomial of the recursion. We describe a method of calculating characteristic polynomials that are optimal with respect to statistical independence of pairs of successive pseudorandom numbers. Tables of such optimal characteristic polynomials for degrees ≤64 are included.

Original language	English (US)
Pages (from-to)	155-163
Number of pages	9
Journal	Computing
Volume	39
Issue number	2
DOIs	https://doi.org/10.1007/BF02310104
State	Published - Jun 1987

All Science Journal Classification (ASJC) codes

Software
Theoretical Computer Science
Numerical Analysis
Computer Science Applications
Computational Theory and Mathematics
Computational Mathematics

Access to Document

10.1007/BF02310104

Cite this

@article{5a0be94cbbc04d43a599fcf801ca5d9a,

title = "Optimal characteristic polynomials for digital multistep pseudorandom numbers",

abstract = "The digital multistep method generates uniform pseudorandom numbers by transforming sequences of integers obtained by multistep recursions. The statistical independence properties of these pseudorandom numbers depend on the characteristic polynomial of the recursion. We describe a method of calculating characteristic polynomials that are optimal with respect to statistical independence of pairs of successive pseudorandom numbers. Tables of such optimal characteristic polynomials for degrees ≤64 are included.",

author = "Mullen, {G. L.} and H. Niederreiter",

year = "1987",

month = jun,

doi = "10.1007/BF02310104",

language = "English (US)",

volume = "39",

pages = "155--163",

journal = "Computing",

issn = "0010-485X",

publisher = "Springer Wien",

number = "2",

}

TY - JOUR

T1 - Optimal characteristic polynomials for digital multistep pseudorandom numbers

AU - Mullen, G. L.

AU - Niederreiter, H.

PY - 1987/6

Y1 - 1987/6

N2 - The digital multistep method generates uniform pseudorandom numbers by transforming sequences of integers obtained by multistep recursions. The statistical independence properties of these pseudorandom numbers depend on the characteristic polynomial of the recursion. We describe a method of calculating characteristic polynomials that are optimal with respect to statistical independence of pairs of successive pseudorandom numbers. Tables of such optimal characteristic polynomials for degrees ≤64 are included.

AB - The digital multistep method generates uniform pseudorandom numbers by transforming sequences of integers obtained by multistep recursions. The statistical independence properties of these pseudorandom numbers depend on the characteristic polynomial of the recursion. We describe a method of calculating characteristic polynomials that are optimal with respect to statistical independence of pairs of successive pseudorandom numbers. Tables of such optimal characteristic polynomials for degrees ≤64 are included.

UR - http://www.scopus.com/inward/record.url?scp=0023579425&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023579425&partnerID=8YFLogxK

U2 - 10.1007/BF02310104

DO - 10.1007/BF02310104

M3 - Article

AN - SCOPUS:0023579425

SN - 0010-485X

VL - 39

SP - 155

EP - 163

JO - Computing

JF - Computing

IS - 2

ER -

Optimal characteristic polynomials for digital multistep pseudorandom numbers

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this