The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Improved long-period generators based on linear recurrences modulo 2
Open accessAbstract
Fast uniform random number generators with extremely long periods have been defined and implemented based on linear recurrences modulo 2. The twisted GFSR and the Mersenne twister are famous recent examples. Besides the period length, the statistical quality of these generators is usually assessed via their equidistribution properties. The huge-period generators proposed so far are not quite optimal in this respect. In this article, we propose new generators of that form with better equidistribution and “bit-mixing” properties for equivalent period length and speed. The state of our new generators evolves in a more chaotic way than for the Mersenne twister. We illustrate how this can reduce the impact of persistent dependencies among successive output values, which can be observed in certain parts of the period of gigantic generators such as the Mersenne twister.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
Matsumoto, M., & Nishimura, T. (1998) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/272991.272995 · Cited by 5,780
Self-citationThe Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · The American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,822
Random Number Generation and Quasi-Monte Carlo Methods.
Collings, B. J., & Niederreiter, H. (1993) · Journal of the American Statistical Association · doi:10.2307/2290359 · Cited by 2,884
Random Number Generation and Quasi-Monte Carlo Methods
Niederreiter, H. (1992) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970081 · Cited by 2,770
TestU01: A C library for empirical testing of random number generators
L'Ecuyer, P., & Simard, R. (2007) · ACM Transactions on Mathematical Software · doi:10.1145/1268776.1268777 · Cited by 1,014
Self-citationGood Parameters and Implementations for Combined Multiple Recursive Random Number Generators
L'Ecuyer, P. (1999) · Operations Research · doi:10.1287/opre.47.1.159 · Cited by 460
Self-citationRandom numbers generated by linear recurrence modulo two
Tausworthe, R. C. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0184406-1 · Cited by 441
An Object-Oriented Random-Number Package with Many Long Streams and Substreams
L'Ecuyer, P., Simard, R., Chen, E. J., & Kelton, W. D. (2002) · Operations Research · doi:10.1287/opre.50.6.1073.358 · Cited by 347
Self-citationUniform random number generation
L'Ecuyer, P. (1994) · Annals of Operations Research · doi:10.1007/bf02136827 · Cited by 279
Self-citationMaximally equidistributed combined Tausworthe generators
L’Ecuyer, P. (1996) · Mathematics of Computation · doi:10.1090/s0025-5718-96-00696-5 · Cited by 267
Self-citationUniform Random Numbers: Theory and Practice
Tezuka, S. (1995) · Cited by 247
(2008) · The Concise Encyclopedia of Statistics · doi:10.1007/978-0-387-32833-1_341 · Cited by 206
Tezuka, S. (1995) · Springer eBooks · doi:10.1007/978-1-4615-2317-8 · Cited by 196
Tables of maximally equidistributed combined LFSR generators
L’Ecuyer, P. (1999) · Mathematics of Computation · doi:10.1090/s0025-5718-99-01039-x · Cited by 178
Self-citationMatsumoto, M., & Kurita, Y. (1994) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/189443.189445 · Cited by 174
Self-citationAn analysis of the pseudo-randomness properties of subsequences of longm-sequences
Lindholm, J. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054188 · Cited by 125
The k -distribution of generalized feedback shift register pseudorandom numbers
Fushimi, M., & Tezuka, S. (1983) · Communications of the ACM · doi:10.1145/358150.358159 · Cited by 97
Efficient and portable combined Tausworthe random number generators
Tezuka, S., & L’Ecuyer, P. (1991) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/116890.116892 · Cited by 93
Self-citationAn Asymptotically Random Tausworthe Sequence
Tootill, J. P. R., Robinson, W. D., & Eagle, D. J. (1973) · Journal of the ACM · doi:10.1145/321765.321778 · Cited by 88
Tables of 64-bit Mersenne twisters
Nishimura, T. (2000) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/369534.369540 · Cited by 85
Uniform random numbers : theory and practice
手塚, 集. (1995) · Kluwer Academic Publishers eBooks · Cited by 75
The hierarchy of correlations in random binary sequences
Compagner, A. (1991) · Journal of Statistical Physics · doi:10.1007/bf01029989 · Cited by 48
Strong deviations from randomness in m -sequences based on trinomials
Matsumoto, M., & Kurita, Y. (1996) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/232807.232815 · Cited by 26
Self-citationPanneton, F. (2004) · Papyrus : Institutional Repository (Université de Montréal) · doi:10.71781/10219 · Cited by 16
Self-citation
Cited by
Computer Simulation of Liquids
Allen, M. P., & Tildesley, D. J. (2017) · doi:10.1093/oso/9780198803195.001.0001 · Cited by 20,945
TestU01: A C library for empirical testing of random number generators
L'Ecuyer, P., & Simard, R. (2007) · ACM Transactions on Mathematical Software · doi:10.1145/1268776.1268777 · Cited by 1,014
Self-citationSIMD-Oriented Fast Mersenne Twister: a 128-bit Pseudorandom Number Generator
Saito, M., & Matsumoto, M. (2008) · Monte Carlo and Quasi-Monte Carlo Methods 2006 · doi:10.1007/978-3-540-74496-2_36 · Cited by 257
Self-citationParallel random numbers: as easy as 1, 2, 3
Salmon, J. K., Moraes, M. A., Dror, R. O., & Shaw, D. E. (2011) · Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1145/2063384.2063405 · Cited by 227
2D axial-azimuthal particle-in-cell benchmark for low-temperature partially magnetized plasmas
Charoy, T., Boeuf, J. P., Bourdon, A., Carlsson, J. A., Chabert, P., Cuenot, B., Eremin, D., Garrigues, L., Hara, K., Kaganovich, I. D., et al. (2019) · Plasma Sources Science and Technology · doi:10.1088/1361-6595/ab46c5 · Cited by 153
Metadata
- Authors
- Panneton, F., L'Ecuyer, P., & Matsumoto, M.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2006-03
- Volume
- 32
- Issue
- 1
- Pages
- 1-16
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W1986517320
- Cited by
- 283
- References
- 26
- FWCI
- 12.94
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.