Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method
From MaRDI portal
Publication:4325729
DOI10.2307/2153334zbMath0823.11040OpenAlexW2031693388MaRDI QIDQ4325729
Publication date: 7 November 1995
Full work available at URL: https://doi.org/10.2307/2153334
upper boundsperiodicitylattice structurediscrete discrepancyserial testpseudorandom vectorsmultiple-recursive matrix method
Random number generation in numerical analysis (65C10) Irregularities of distribution, discrepancy (11K38) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (5)
A brief and understandable guide to pseudo-random number generators and specific models for security ⋮ 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 ⋮ A note on the multiple-recursive matrix method for generating pseudorandom vectors
Cites Work
- The serial test for pseudo-random numbers generated by the linear congruential method
- Random number generators for parallel processors
- Statistical independence properties of pseudorandom vectors produced by matrix generators
- The lattice structure of pseudo-random vectors generated by matrix generators
- Pseudo-random numbers and optimal coefficients
- Factorization of polynomials and some linear-algebra problems over finite fields
- The multiple-recursive matrix method for pseudorandom number generation
- Uniform random number generation
- Random Number Generators on Vector Supercomputers and Other Advanced Architectures
- Design and Analysis of Parallel Monte Carlo Algorithms
- Pseudorandom vector generation by the inversive method
- Twisted GFSR generators
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method
