F2-linear random number generators

International Series in Operations Research and Management Science

Volumn 133, Issue , 2009, Pages 169-193

  L’Ecuyer, Pierre ^a   Panneton, François ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84955107781     PISSN: 08848289     EISSN: None     Source Type: Book Series    
DOI: 10.1007/b110059_9     Document Type: Chapter

References (52)

1. Brent, R. P. 2004. Note on Marsaglia’s xorshift random number generators. Journal of Statistical Software 11(5):1–4.
2. Brent, R. P., and P. Zimmermann. 2003. Random number generators with period divisible by a Mersenne prime. In Computational Science and its Applications—ICCSA 2003, eds. V. Kumar, M. L. Gavrilova, C. J. K. Tan, and P. L’Ecuyer, Volume 2667 of Lecture Notes in Computer Science, pp. 1–10. Berlin: Springer-Verlag.
3. Compagner, A. 1991. The hierarchy of correlations in random binary sequences. Journal of Statistical Physics 63:883–896.
4. Couture, R., and P. L’Ecuyer. 2000. Lattice computations for random numbers. Mathematics of Computation 69(230):757–765.
5. Erdmann, E. D. 1992. Empirical tests of binary keystreams. Master’s thesis, Department of Mathematics, Royal Holloway and Bedford New College, University of London.
6. Fishman, G. S. 1996. Monte Carlo: Concepts, Algorithms, and Applications. New York: Springer- Verlag.
7. Fushimi, M. 1983. Increasing the orders of equidistribution of the leading bits of the Tausworthe sequence. Information Processing Letters 16:189–192.
8. Golub, G. H., and C. F. Van Loan. 1996. Matrix Computations, 3rd edition. Baltimore: John Hopkins University Press.
9. Haramoto, H., M. Matsumoto, T. Nishimura, F. Panneton, and P. L’Ecuyer. 2008. Efficient jump ahead for F2-linear random number generators. INFORMS Journal on Computing 20(3):385–390.
10. Hellekalek, P., and G. Larcher (eds.) 1998. Random and Quasi-Random Point Sets, Volume 138 of Lecture Notes in Statistics. New York: Springer-Verlag.
11. Knuth, D. E. 1998. The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd edition. Reading, MA: Addison-Wesley.
12. Law, A. M., and W. D. Kelton. 2000. Simulation Modeling and Analysis, 3rd edition. New York: McGraw-Hill.
13. L’Ecuyer, P. 1994. Uniform random number generation. Annals of Operations Research 53: 77–120.
14. L’Ecuyer, P. 1996. Maximally equidistributed combined Tausworthe generators. Mathematics of Computation 65(213):203–213.
15. L’Ecuyer, P. 1999a. Good parameters and implementations for combined multiple recursive random number generators. Operations Research 47(1):159–164.
16. L’Ecuyer, P. 1999b. Tables of maximally equidistributed combined LFSR generators. Mathematics of Computation 68(225):261–269.
17. L’Ecuyer, P. 2004. Polynomial integration lattices. In Monte Carlo and Quasi-Monte Carlo Methods 2002, ed. H. Niederreiter, pp. 73–98. Berlin: Springer-Verlag.
18. L’Ecuyer, P. 2006. Uniform random number generation. In Simulation, eds. S. G. Henderson and B. L. Nelson, Handbooks in Operations Research and Management Science, pp. 55–81. Amsterdam, The Netherlands: Elsevier.
19. L’Ecuyer, P., and E. Buist. 2005. Simulation in Java with SSJ. In Proceedings of the 2005 Winter Simulation Conference, eds. M. E. Kuhl, N. M. Steiger, F. B. Armstrong, and J. A. Joines, pp. 611–620. Pistacaway, NJ: IEEE Press.
20. L’Ecuyer, P., and J. Granger-Piché. 2003. Combined generators with components from different families. Mathematics and Computers in Simulation 62:395–404.
21. L’Ecuyer, P., and C. Lemieux. 2002. Recent advances in randomized quasi-Monte Carlo methods. In Modeling Uncertainty: An Examination of Stochastic Theory, Methods, and Applications, eds. M. Dror, P. L’Ecuyer, and F. Szidarovszky, pp. 419–474. Boston: Kluwer Academic.
22. L’Ecuyer, P., and F. Panneton. 2002. Construction of equidistributed generators based on linear recurrences modulo 2. In Monte Carlo and Quasi-Monte Carlo Methods 2000, eds. K.-T. Fang, F. J. Hickernell, and H. Niederreiter, pp. 318–330. Berlin: Springer-Verlag.
23. L’Ecuyer, P., and R. Simard. 2007, August. TestU01: A C library for empirical testing of random number generators. ACM Transactions on Mathematical Software 33(4):Article 22.
24. L’Ecuyer, P., R. Simard, E. J. Chen, and W. D. Kelton. 2002. An object-oriented random-number package with many long streams and substreams. Operations Research 50(6):1073–1075.
25. L’Ecuyer, P., and R. Touzin. 2000. Fast combined multiple recursive generators with multipliers of the form a = ±2q ± 2r. In Proceedings of the 2000 Winter Simulation Conference, eds. J. A. Joines, R. R. Barton, K. Kang, and P. A. Fishwick, pp. 683–689. Pistacaway, NJ: IEEE Press.
26. Lemieux, C., and P. L’Ecuyer. 2002. Randomized polynomial lattice rules for multivariate integration and simulation. Extended version available online at http://www.iro.umontreal.ca/lecuyer
27. Lemieux, C., and P. L’Ecuyer. 2003. Randomized polynomial lattice rules for multivariate integration and simulation. SIAM Journal on Scientific Computing 24(5):1768–1789.
28. Lenstra, A. K. 1985. Factoring multivariate polynomials over finite fields. Journal of Computer and System Sciences 30:235–248.
29. Lewis, T. G., and W. H. Payne. 1973. Generalized feedback shift register pseudorandom number algorithm. Journal of the ACM 20(3):456–468.
30. Lidl, R., and H. Niederreiter. 1986. Introduction to Finite Fields and Their Applications. Cambridge: Cambridge University Press.
31. Lindholm, J. H. 1968. An analysis of the pseudo-randomness properties of subsequences of long m-sequences. IEEE Transactions on Information Theory IT-14(4):569–576.
32. Marsaglia, G. 1985. A current view of random number generators. In Computer Science and Statistics, Sixteenth Symposium on the Interface, pp. 3–10. North-Holland, Amsterdam: Elsevier Science Publishers.
33. Marsaglia, G. 2003. Xorshift RNGs. Journal of Statistical Software 8(14):1–6.
34. Massey, J. L. 1969. Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory IT-15:122–127.
35. Matsumoto, M., and Y. Kurita. 1992. Twisted GFSR generators. ACM Transactions on Modeling and Computer Simulation 2(3):179–194.
36. Matsumoto, M., and Y. Kurita. 1994. Twisted GFSR generators II. ACM Transactions on Modeling and Computer Simulation 4(3):254–266.
37. Matsumoto, M., and Y. Kurita. 1996. Strong deviations from randomness in m-sequences based on trinomials. ACM Transactions on Modeling and Computer Simulation 6(2):99–106.
38. Matsumoto, M., and T. Nishimura. 1998. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation 8(1):3–30.
39. Niederreiter, H. 1992. Random Number Generation and Quasi-Monte Carlo Methods, Volume 63 of SIAM CBMS-NSF Regional Conference Series in Applied Mathematics. Philadelphia, PA: SIAM.
40. Nishimura, T. 2000. Tables of 64-bit Mersenne twisters. ACM Transactions on Modeling and Computer Simulation 10(4):348–357.
41. Panneton, F. 2004, August. Construction d’ensembles de points basée sur des récurrences linéaires dans un corps fini de caract´eristique 2 pour la simulation Monte Carlo et l’int´egration quasi-Monte Carlo. Ph.D. thesis, D´epartement d’informatique et de recherche op´erationnelle, Universit´e de Montr´eal, Canada.
42. Panneton, F., and P. L’Ecuyer. 2004. Random number generators based on linear recurrences i nF2w. In Monte Carlo and Quasi-Monte Carlo Methods 2002, ed. H. Niederreiter, pp. 367–378. Berlin: Springer-Verlag.
43. Panneton, F., and P. L’Ecuyer. 2005. On the xorshift random number generators. ACMTransactions on Modeling and Computer Simulation 15(4): 346–361.
44. Panneton, F., and P. L’Ecuyer. 2007. Resolution-stationary random number generators. Mathematics and Computers in Simulation, to appear.
45. Panneton, F., P. L’Ecuyer, and M. Matsumoto. 2006. Improved long-period generators based on linear recurrences modulo 2. ACM Transactions on Mathematical Software 32(1):1–16.
46. Rieke, A., A.-R. Sadeghi, and W. Poguntke. 1998, August. On primitivity tests for polynomials. In Proceedings of the 1998 IEEE International Symposium on Information Theory. Cambridge, MA.
47. Strang, G. 1988. Linear Algebra and its Applications, 3rd edition. Philadelphia, PA: Saunders.
48. Tausworthe, R. C. 1965. Random numbers generated by linear recurrence modulo two. Mathematics of Computation 19:201–209.
49. Tezuka, S. 1995. Uniform Random Numbers: Theory and Practice. Norwell, MA: Kluwer Academic Publishers.
50. Tezuka, S., and P. L’Ecuyer. 1991. Efficient and portable combined Tausworthe random number generators. ACM Transactions on Modeling and Computer Simulation 1(2):99–112.
51. Tootill, J. P. R., W. D. Robinson, and D. J. Eagle. 1973. An asymptotically random Tausworthe sequence. Journal of the ACM 20:469–481.
52. Wang, D., and A. Compagner. 1993. On the use of reducible polynomials as random number generators. Mathematics of Computation 60:363–374.