### 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 | |

State | Published - Jun 1 1987 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

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

### Cite this

*Computing*,

*39*(2), 155-163. https://doi.org/10.1007/BF02310104

}

*Computing*, vol. 39, no. 2, pp. 155-163. https://doi.org/10.1007/BF02310104

**Optimal characteristic polynomials for digital multistep pseudorandom numbers.** / Mullen, G. L.; Niederreiter, H.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Optimal characteristic polynomials for digital multistep pseudorandom numbers

AU - Mullen, G. L.

AU - Niederreiter, H.

PY - 1987/6/1

Y1 - 1987/6/1

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

VL - 39

SP - 155

EP - 163

JO - Computing (Vienna/New York)

JF - Computing (Vienna/New York)

SN - 0010-485X

IS - 2

ER -