Optimal characteristic polynomials for digital multistep pseudorandom numbers

G. L. Mullen, H. Niederreiter

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


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 languageEnglish (US)
Pages (from-to)155-163
Number of pages9
Issue number2
StatePublished - Jun 1987

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'Optimal characteristic polynomials for digital multistep pseudorandom numbers'. Together they form a unique fingerprint.

Cite this