Initializing generalized feedback shift register pseudorandom number generators
From MaRDI portal
Publication:3810781
DOI10.1145/6490.6493zbMath0661.65003OpenAlexW2020147756MaRDI QIDQ3810781
G. Barry Hembree, Bruce Jay Collings
Publication date: 1986
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/6490.6493
polynomial representationinitialization procedurefeedback shift register pseudorandom number generators
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Random number generation in numerical analysis (65C10)
Related Items (6)
A comparative study of some pseudorandom number generators ⋮ String decomposition of full-period tausworthe sequences ⋮ 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 ⋮ Recent trends in random number and random vector generation ⋮ Classes of GFSR sequences and their fast generation
This page was built for publication: Initializing generalized feedback shift register pseudorandom number generators
