The first return time test of pseudorandom numbers
From MaRDI portal
Publication:1612346
DOI10.1016/S0377-0427(01)00510-6zbMath1002.65011MaRDI QIDQ1612346
Publication date: 22 August 2002
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Entropy and other invariants (28D20) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (2)
Tests of randomness by the gambler's ruin algorithm ⋮ ON THE EXPANSIONS OF REAL NUMBERS IN TWO MULTIPLICATIVELY DEPENDENT BASES
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- String overlaps, pattern matching, and nontransitive games
- Periods in strings
- A universal statistical test for random bit generators
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
- Entropy and data compression schemes
- Average convergence rate of the first return time
This page was built for publication: The first return time test of pseudorandom numbers