Testing randomness via aperiodic words
From MaRDI portal
Recommendations
- Distribution of the number of words with a prescribed frequency and tests of randomness
- Pseudorandom number generators based on infinite words.
- Approximate entropy for testing randomness
- R-2 composition tests: a family of statistical randomness tests for a collection of binary sequences
- Statistical testing of randomness: new and old procedures
Cites work
- Approximate entropy for testing randomness
- Asymptotic normality of decomposable statistics on the frequencies of m-tuples
- Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
- Distribution of the number of words with a prescribed frequency and tests of randomness
- scientific article; zbMATH DE number 52632 (Why is no real title available?)
- scientific article; zbMATH DE number 3586221 (Why is no real title available?)
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- Monkey tests for random number generators
- Not all (possibly) “random” sequences are created equal
- Periods in strings
- Regularities in congruential random number generators
Cited in
(8)- Identification of random strings through statistical estimation of transition vectors
- R-2 composition tests: a family of statistical randomness tests for a collection of binary sequences
- Pseudorandom number generators based on infinite words.
- Aperiodic pseudorandom number generators based on infinite words
- The properties of bi-ideals in the frequency test
- Testing Stream Ciphers by Finding the Longest Substring of a Given Density
- Distribution of the number of words with a prescribed frequency and tests of randomness
- Pattern Correlation Matrices for Markov Sequences and Tests of Randomness
This page was built for publication: Testing randomness via aperiodic words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3615033)
