Random number generation with the recursion X t =X t-3p ⊕X t-3q

[1]  R. Tausworthe.  Random Numbers Generated by Linear Recurrence Modulo Two , 1965 .

[2]  Neal Zierler,et al.  On Primitive Trinomials (Mod 2) , 1968, Inf. Control..

[3]  G. Marsaglia.  Random numbers fall mainly in the planes. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[4]  J. P. R. Tootill,et al.  The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number Generators , 1971, JACM.

[5]  Ted G. Lewis,et al.  Generalized Feedback Shift Register Pseudorandom Number Algorithm , 1973, JACM.

[6]  J. P. R. Tootill,et al.  An Asymptotically Random Tausworthe Sequence , 1973, JACM.

[7]  John M. Chambers,et al.  Computational Methods for Data Analysis. , 1978 .

[8]  G. S. Fishman.  Principles of Discrete Event Simulation , 1978 .

[9]  W. H. Payne,et al.  Orderly enumeration of nonsingular binary matrices applied to text encryption , 1978, CACM.

[10]  Dimitris G. Maritsas,et al.  Partitioning the Period of a Class of m-Sequences and Application to Pseudorandom Number Generation , 1978, JACM.

[11]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[12]  Solomon W. Golomb,et al.  Shift Register Sequences , 1981 .

[13]  Scott Kirkpatrick,et al.  A very fast shift-register sequence random number generatorjournal of computational physics , 1981 .

[14]  Shu Tezuka,et al.  The k-distribution of generalized feedback shift register pseudorandom numbers , 1983, CACM.

[15]  G. Marsaglia,et al.  Matrices and the structure of random number sequences , 1985 .

[16]  Bruce Jay Collings,et al.  Initializing generalized feedback shift register pseudorandom number generators , 1986, JACM.