A universal GFSR random number generator for personal computers
From MaRDI portal
Publication:1359814
DOI10.1016/0010-4655(94)00114-HzbMath0873.65003MaRDI QIDQ1359814
Publication date: 16 October 1997
Published in: Computer Physics Communications (Search for Journal in Brave)
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\)
- An equivalence relation between Tausworthe and GFSR sequences and applications
- Increasing the orders of equidistribution of the leading bits of the Tausworthe sequence
- A very fast shift-register sequence random number generator
- Pseudorandom number generators for personal computers. II
- Pseudorandom number generators for Salford FTN77
- A review of pseudorandom number generators
- Pseudorandom number generators for personal computers
- Regularities in congruential random number generators
- Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
- Empirical Tests of an Additive Random Number Generator
- Primitive Polynomials (Mod 2)
- The k -distribution of generalized feedback shift register pseudorandom numbers
- NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION
- Random Numbers Generated by Linear Recurrence Modulo Two
- On primitive trinomials (Mod 2)
- RANDOM NUMBERS FALL MAINLY IN THE PLANES
- Primitive Trinomials of High Degree
- On primitive trinomials (mod 2), II
- Primitive trinomials whose degree is a Mersenne exponent
- Generalized Feedback Shift Register Pseudorandom Number Algorithm
This page was built for publication: A universal GFSR random number generator for personal computers
