id: 00579522
dt: j
an: 00579522
au: Wang, Dakai; Compagner, Aaldert
ti: On the use of reducible polynomials as random number generators.
so: Math. Comput. 60, No.201, 363-374 (1993).
py: 1993
pu: American Mathematical Society, Providence, RI
la: EN
cc: 
ut: random number generation; large-scale Monte Carlo simulations
ci: 
li: doi:10.2307/2153173
ab: Summary: The randomness properties and the hierarchy of correlation
    coefficients are studied of approximate-maximum-length sequences, for
    which the characteristic polynomial is a product of several primitive
    polynomials. The randomness properties are almost the same as for
    maximum-length sequences characterized by a primitive polynomial with
    many terms and of the same degree. Reducible characteristic polynomials
    have acceptable figures of merit and can be of extremely high degree.
    Since they are also easily constructed and implemented, reducible
    polynomials are strong candidates for reliable random number
    generation, especially at the bit rates needed in large-scale Monte
    Carlo simulations.
rv: