✦ LIBER ✦

On a multiplicative generator of pseudorandom numbers

✍ Scribed by I.E. Shparlinskii

Publisher: Elsevier Science
Year: 1984
Weight: 220 KB
Volume: 24
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(84)90159-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matrix generator of pseudorandom numbers

✍ N.Z Akopov; G.K Savvidy; N.G Ter-Arutyunyan-Savvidy 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 272 KB

The Multiple-Recursive Matrix Method for

The Multiple-Recursive Matrix Method for Pseudorandom Number Generation

✍ H. Niederreiter 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 859 KB

We carry out an in-depth analysis of the multiple-recursive matrix method for uniform pseudorandom number generation which was introduced in an earlier paper of the author. This method yields much larger period lengths than the GFSR method with the same order of the recursion and the same precision.

A method of generating pseudorandom norm

A method of generating pseudorandom normal numbers

✍ R.E. Gut; V.V. Egorov; V.N. Il'in 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 177 KB

The generation of pseudorandom correlate

The generation of pseudorandom correlated Gauss numbers

✍ R.E. Gut; V.V. Egorov 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 167 KB

On the Average Distribution of Inversive

On the Average Distribution of Inversive Pseudorandom Numbers

✍ Harald Niederreiter; Igor E. Shparlinski 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 146 KB

The inversive congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. The authors have recently introduced a new method for obtaining nontrivial upper bounds on the multidimensional discrepancy of inversive congruential pseudor

Improved Bounds in the Multiple-Recursiv

Improved Bounds in the Multiple-Recursive Matrix Method for Pseudorandom Number and Vector Generation

✍ Harold Niederreiter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 275 KB

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 -splitting subspaces of f