Aperiodic pseudorandom number generators based on infinite words
From MaRDI portal
Publication:306725
DOI10.1016/j.tcs.2016.07.042zbMath1349.65022arXiv1311.6002OpenAlexW1871515479MaRDI QIDQ306725
Michelangelo Bucci, Svetlana Puzynina, Alessandro De Luca, Jiří Hladký, L'ubomíra Balková
Publication date: 1 September 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.6002
Sturmian wordpseudorandom number generatorArnoux-Rauzy wordlinear congruential generatorwell distributed occurrences
Related Items
The abelian complexity of infinite words and the Frobenius problem, Derived sequences of complementary symmetric Rote sequences, On balanced sequences and their asymptotic critical exponent, On balanced sequences and their critical exponent
Uses Software
Cites Work
- Unnamed Item
- Infinite self-shuffling words
- Sturmian words: structure, combinatorics, and their arithmetics
- Statistical properties and implementation of aperiodic pseudorandom number generators
- Proving the deterministic period breaking of linear congruential generators using two tile quasicrystals
- Infinite Words with Well Distributed Occurrences
- TestU01
- Représentation géométrique de suites de complexité $2n+1$
- RANDOM NUMBERS FALL MAINLY IN THE PLANES
- Episturmian words and some constructions of de Luca and Rauzy