The k -distribution of generalized feedback shift register pseudorandom numbers
From MaRDI portal
Publication:3662622
DOI10.1145/358150.358159zbMath0515.68047OpenAlexW2015055128MaRDI QIDQ3662622
No author found.
Publication date: 1983
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/358150.358159
computer timegeneralized feedback shift register sequenceastronomical amounthigh degree of resolution
Related Items (21)
Uses and abuses of statistical simulation ⋮ A universal GFSR random number generator for personal computers ⋮ A comparative study of some pseudorandom number generators ⋮ On the structure of parallelized random number sources ⋮ Geometric and Statistical Properties of Pseudorandom Number Generators Based on Multiple Recursive Transformations ⋮ Several extensively tested multiple recursive random number generators ⋮ Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\) ⋮ Thoughts on pseudorandom number generators ⋮ An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm ⋮ An equivalence relation between Tausworthe and GFSR sequences and applications ⋮ Recent trends in random number and random vector generation ⋮ The revised recursive reduction for efficiently generating random numbers ⋮ Resolution-stationary random number generators ⋮ Lattice computations for random numbers ⋮ Uniform random number generation ⋮ Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators ⋮ Classes of GFSR sequences and their fast generation ⋮ On Optimal GFSR Pseudorandom Number Generators ⋮ Increasing the orders of equidistribution of the leading bits of the Tausworthe sequence ⋮ Matrices and the structure of random number sequences ⋮ Combined random number generator via the generalized Chinese remainder theorem
This page was built for publication: The k -distribution of generalized feedback shift register pseudorandom numbers
