Statistical independence properties of pseudorandom vectors produced by matrix generators
Journal of Computational and Applied Mathematics - Random numbers and simulation
Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
Pseudorandom vector generation by the multiple-recursive matrix method
Mathematics of Computation
Some linear and nonlinear methods for pseudorandom number generation
WSC '95 Proceedings of the 27th conference on Winter simulation
The Multiple-Recursive Matrix Method for Pseudorandom Number Generation
Finite Fields and Their Applications
Primitive polynomials, singer cycles and word-oriented linear feedback shift registers
Designs, Codes and Cryptography
Word-Oriented transformation shift registers and their linear complexity
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
| Hi-index | 0.00 |
The multiple-recursive matrix method is a general linear method for the generation of uniform pseudorandom numbers and vectors which was introduced and studied in earlier papers of the author. In this paper we improve on various bounds in this method by using information on @s-splitting subspaces of finite fields.