Optimal characteristic polynomials for digital multistep pseudorandom numbers

DOI10.1007/BF02310104zbMath0618.65004OpenAlexW1523628657MaRDI QIDQ1822442

Harald Niederreiter, Gary L. Mullen

Publication date: 1987

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02310104

zbMATH Keywords

tablescontinued fraction expansionprimitive polynomialsserial testdigital multistep pseudorandom numbers

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)

Related Items (5)

Calculation of Fibonacci Polynomials for GFSR Sequences with Low Discrepancies ⋮ Recent trends in random number and random vector generation ⋮ Good Parameters for a Class of Node Sets in Quasi-Monte Carlo Integration ⋮ On the Use of Reducible Polynomials as Random Number Generators ⋮ Low-discrepancy point sets obtained by digital constructions over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point sets and sequences with small discrepancy
• Rational functions with partial quotients of small degree in their continued fraction expansion
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• The Performance of k-Step Pseudorandom Number Generators under the Uniformity Test
• Random Numbers Generated by Linear Recurrence Modulo Two
• RANDOM NUMBERS FALL MAINLY IN THE PLANES

This page was built for publication: Optimal characteristic polynomials for digital multistep pseudorandom numbers