Testing randomness via aperiodic words
From MaRDI portal
Publication:3615033
DOI10.1080/10629360600864142zbMath1169.62097OpenAlexW2021731815MaRDI QIDQ3615033
V. Eh. Vol'kovich, Andrew. L. Rukhin
Publication date: 17 March 2009
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10629360600864142
asymptotic normalityblock ciphersrandom number generatorspatternsefficacyoptimal linear test\(\chi ^2\) test
Asymptotic distribution theory in statistics (62E20) Parametric hypothesis testing (62F03) Applications of statistics (62P99) Limit theorems in probability theory (60F99)
Uses Software
Cites Work
- Periods in strings
- Monkey tests for random number generators
- Regularities in congruential random number generators
- Asymptotic normality of decomposable statistics on the frequencies of m-tuples
- Not all (possibly) “random” sequences are created equal
- Approximate entropy for testing randomness
- Distribution of the number of words with a prescribed frequency and tests of randomness
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item