Figures of Merit for Digital Multistep Pseudorandom Numbers
From MaRDI portal
Recommendations
- Optimal characteristic polynomials for digital multistep pseudorandom numbers
- scientific article; zbMATH DE number 4090661
- Publication:5749363
- scientific article; zbMATH DE number 3868483
- On a multiplicative generator of pseudorandom numbers
- scientific article; zbMATH DE number 4141372
- Explicit digital inversive pseudorandom numbers
- Linear-inversive generator of PRN's with a variable multiplier
- A remark on the discrepancy of quadratic congruential pseudorandom numbers
- On the statistical independence of shift-register pseudorandom multisequence over part of the period
Cited in
(10)- Recent trends in random number and random vector generation
- A comparative study of some pseudorandom number generators
- Uniform random number generation
- Optimal characteristic polynomials for digital multistep pseudorandom numbers
- Good Parameters for a Class of Node Sets in Quasi-Monte Carlo Integration
- scientific article; zbMATH DE number 4090661 (Why is no real title available?)
- Low-discrepancy point sets obtained by digital constructions over finite fields
- On the Use of Reducible Polynomials as Random Number Generators
- Calculation of Fibonacci Polynomials for GFSR Sequences with Low Discrepancies
- On the statistical independence of shift-register pseudorandom multisequence over part of the period
This page was built for publication: Figures of Merit for Digital Multistep Pseudorandom Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3477864)