NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION

DOI10.1142/S0129183192000361zbMath0940.11506OpenAlexW2017058910MaRDI QIDQ4488285

A. Compagner, Henk W. J. Blöte, Jouke R. Heringa

Publication date: 5 July 2000

Published in: International Journal of Modern Physics C (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129183192000361

zbMATH Keywords

random-number generationprimitive trinomialsMersenne exponent

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (7)

A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 ⋮ A universal GFSR random number generator for personal computers ⋮ A comparative study of some pseudorandom number generators ⋮ Lattice computations for random numbers ⋮ Ten new primitive binary trinomials ⋮ Uniform random number generation ⋮ Explicit theorems on generator polynomials

This page was built for publication: NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION