Work

Tests de générateurs pseudo-aléatoires

Year: 1973
Type: article
Abstract: In computers, pseudo-random numbers are usually generated through a linear congruential sequence. Coveyou and MacPherson [1] propose a test of the randomness of n-uples, Dieter [2] proposes another test for the pairs ; both are theoretical tests. These are described and applied to some generators. Arithmetic routines handling integer numbers without limitation of size have been developped to implement the first test, they are outlined in the paper.
Authors: Raymond Devillers, J. J. Dumont, Guy Latouche
Language: English
Open Access status: green
OpenAlex ID: W755681722
FWCI:
Cites:
Cited by: 2
Related to: 10