Random Numbers Generated by Linear Recurrence Modulo Two
From MaRDI portal
Publication:5511710
DOI10.2307/2003345zbMath0137.34804MaRDI QIDQ5511710
Publication date: 1965
Full work available at URL: https://doi.org/10.2307/2003345
Related Items
An Expanded Set of Correlation Tests for Linear Congruential Random Number Generators, On the Periods of Generalized Fibonacci Recurrences, Maximally equidistributed combined Tausworthe generators, Calculation of Fibonacci Polynomials for GFSR Sequences with Low Discrepancies, Unnamed Item, Primitive Trinomials of High Degree, Optimal strong primes, 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, Maximally equidistributed pseudorandom number generators via linear output transformations, A special-purpose processor for the Monte Carlo simulation of Ising spin systems, Increasing the orders of equidistribution of the leading bits of the Tausworthe sequence, A fast processor for Monte-Carlo simulation, An algorithm for pseudo random number generation suitable for large scale integration, Rational functions with partial quotients of small degree in their continued fraction expansion, The period of the Fibonacci random number generator, Implementation of a random number generator in OCCAM, ACORN - A new method for generating sequences of uniformly distributed pseudo-random numbers, Development and testing of a high precision digital Gaussian generator for computers, The Monte Carlo method, A very fast shift-register sequence random number generator, Recent trends in random number and random vector generation, Theory and design of a digital stochastic computer random number generator, Hardware simulation of semi-Markov and related processes. I: A versatile generator, Generation de nombres aléatoires correles, Discrete event simulation modelling of computer systems for performance evaluation, Pseudo-random trees: Multiple independent sequence generators for parallel and branching computations, A universal GFSR random number generator for personal computers, A comparative study of some pseudorandom number generators, Pseudorandom number generators for personal computers. II, Pseudorandom number generators for Salford FTN77, Orthogonal sequences of polynomials over arbitrary fields, Misspecified heteroskedasticity in the panel probit model: A small sample comparison of GMM and SML estimators, Uniform random number generation, Classes of GFSR sequences and their fast generation, Maximum-length sequences, cellular automata, and random numbers, Optimal characteristic polynomials for digital multistep pseudorandom numbers, Path integral approach for electron transport in disturbed magnetic field lines, Combined generators with components from different families, Pseudorandom number generators for personal computers, Parallelization of adaptive MC integrators, Asymptotic complexity of Monte Carlo methods for solving linear systems, Polynomial pseudo-random number generator via cyclic phase, Unnamed Item, Quasi-Monte Carlo methods and pseudo-random numbers, On the Distribution of Pseudo-Random Numbers Generated by the Linear Congruential Method. III
Cites Work
