On the Use of Reducible Polynomials as Random Number Generators
From MaRDI portal
Publication:4293976
DOI10.2307/2153173zbMATH Open0795.65001OpenAlexW4256046869MaRDI QIDQ4293976FDOQ4293976
Authors: Dakai Wang, A. Compagner 
Publication date: 10 July 1994
Full work available at URL: https://doi.org/10.2307/2153173
Recommendations
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A review of pseudorandom number generators
- Recent trends in random number and random vector generation
- Weights of cyclic codes
- On primitive trinomials (Mod 2)
- Thoughts on pseudorandom number generators
- Primitive trinomials whose degree is a Mersenne exponent
- Some Factorizations of 2 n ± 1 and Related Results
- Optimal characteristic polynomials for digital multistep pseudorandom numbers
- Figures of Merit for Digital Multistep Pseudorandom Numbers
- Maximum-length sequences, cellular automata, and random numbers
Cited In (7)
- Using irreducible polynomials for random number generation
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- Polynomial pseudo-random number generator via cyclic phase
- An experimental exploration of Marsaglia's \texttt{xorshift} generators, scrambled
- Uniform random number generation
- Maximum-length sequences, cellular automata, and random numbers
- Maximally equidistributed combined Tausworthe generators
Uses Software
This page was built for publication: On the Use of Reducible Polynomials as Random Number Generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4293976)
