Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\)
type: Item
instance of: scholarly article
title: Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\)
zbMATH Open document ID: 0701.65005
DOI: 10.1016/0377-0427(90)90341-V
author: Masanori Fushimi
published in: Journal of Computational and Applied Mathematics
publication date: 1990-01-01T00:00:00Z
review text: The author discusses a modification of the Marsaglia pseudorandom generator of the form given in the title. The paper contains the FORTRAN program that initializes and runs the generator. The principles of the initialization are discussed in detail using the theory of Galois fields. Results of the statistical tests of the generator are given. The author concludes that the generator has better properties than the Marsaglia one.
Mathematics Subject Classification ID: 65C10
Mathematics Subject Classification ID: 62-04
zbMATH DE Number: 4149435
zbMATH Keywords: Marsaglia pseudorandom generator
zbMATH Keywords: FORTRAN program
zbMATH Keywords: initialization
zbMATH Keywords: statistical tests
reviewed by: Jaroslav Král
MaRDI profile type: Publication
cites work: Partitioning the Period of a Class of m -Sequences and Application to Pseudorandom Number Generation
cites work: Q3881781
cites work: Q4195900
cites work: Initializing generalized feedback shift register pseudorandom number generators
cites work: Q3323320
cites work: The k -distribution of generalized feedback shift register pseudorandom numbers
cites work: Q3875078
cites work: A very fast shift-register sequence random number generator
cites work: Q3935355
cites work: Generalized Feedback Shift Register Pseudorandom Number Algorithm
cites work: RANDOM NUMBERS FALL MAINLY IN THE PLANES
cites work: Regularities in congruential random number generators
cites work: Matrices and the structure of random number sequences
cites work: Orderly enumeration of nonsingular binary matrices applied to text encryption
cites work: Q4172886
cites work: Random Numbers Generated by Linear Recurrence Modulo Two
cites work: The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number Generators
cites work: An Asymptotically Random Tausworthe Sequence
cites work: On primitive trinomials (mod 2), II
description: scientific article; zbMATH DE number 4149435