Improved bounds in the multiple-recursive matrix method for pseudorandom number and vector generation

DOI10.1006/FFTA.1996.0015zbMath0893.11031OpenAlexW2087240261MaRDI QIDQ1383501

Harald Niederreiter

Publication date: 26 April 1998

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1996.0015

zbMATH Keywords

estimates for discrepanciesmultiple-recursive matrix pseudorandom number and vector generators

Mathematics Subject Classification ID

Finite fields and commutative rings (number-theoretic aspects) (11T99) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (5)

Nonlinear vectorial primitive recursive sequences ⋮ Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers ⋮ Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs ⋮ Average equidistribution and statistical independence properties of digital inversive pseudorandom numbers over parts of the period ⋮ A note on the multiple-recursive matrix method for generating pseudorandom vectors

This page was built for publication: Improved bounds in the multiple-recursive matrix method for pseudorandom number and vector generation