Communications of the ACM, vol. 26,no. 7,1983 – CACM
A necessary and sufficient condition is established for the generalized feedback shift register (GFSR) sequence introduced by Lewis and Payne to be k-distributed. Based upon the theorem, a theoretical test for k-distributivity is proposed and ...
ACM Transactions on Modeling and Computer Simulation, vol. 1,no. 2,1991 – TOMACS
In this paper, we propose three combined Tausworthe random number generators with period length about 1018, whose k-distribution properties are good and which can be implemented in a portable way. These generators are found through an exhaustive ...
Shu Tezuka, Pierre L'Ecuyer, Raymond Couture
ACM Transactions on Modeling and Computer Simulation, vol. 3,no. 4,1993 – TOMACS
Marsaglia and Zaman recently proposed new classes of random number generators, called add-with-carry(AWC) and subtract-with-borrow(SWB), which are capable of quickly generating very long-period (pseudo)-random number sequences using very little ...
Communications of the ACM, vol. 30,no. 8,1987 – CACM
By applying Weyl's criterion for k-distributivity to GFSR sequences, we derive a new theoretical test for investigating the statistical property of GFSR sequences. This test provides a very useful measure for examining the k-distribution, that is, ...
ACM Transactions on Modeling and Computer Simulation, vol. 3,no. 2,1993 – TOMACS
We introduce the radical inverse function with respect to polynomial arithmetic over finite fields, and thereby construct a polynomial arithmetic analogue of Halton sequences. Next, we generalize the definition of Niederreiter sequences so that his ...
Journal of the ACM, vol. 34,no. 4,1987 – JACM
A new summation formula based on the orthogonal property of Walsh functions is devised. Using this formula, the k-dimensional discrepancy of the generalized feedback shift register (GFSR) pseudorandom numbers is derived. The relation between the ...
Proceedings of the 24th Winter Simulation Conference, 1992 – WSC
Marsaglia and Zaman recently proposed a new class of random number generators, acid-with-carr~ and subtractwith-borrow, which are capable of quickly generating very long period (pseudo) -random number sequences using very little memory. We show that ...
ACM Transactions on Modeling and Computer Simulation, vol. 4,no. 3,1994 – TOMACS
In this article, we investigate (O, k )-sequences in a prime power base b > h obtained from Halton sequences with respect to polynomial arithmetic over finite fields. We show that for 1 < h < k, the generator matrix of the hth coordinate of ...