Aperiodic Pseudorandom Number Generators Based on Infinite Words

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F16%3A00300783" target="_blank" >RIV/68407700:21340/16:00300783 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.tcs.2016.07.042" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2016.07.042</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2016.07.042" target="_blank" >10.1016/j.tcs.2016.07.042</a>

Result language
angličtina
Original language name
Aperiodic Pseudorandom Number Generators Based on Infinite Words
Original language description
In this paper we study how certain families of aperiodic infinite words can be used to produce aperiodic pseudorandom number generators (PRNGs) with good statistical behavior. We introduce the well distributed occurrences (WELLDOC) combinatorial property for infinite words, which guarantees absence of the lattice structure defect in related pseudorandom number generators. We prove that Sturmian words, and more generally Arnoux-Rauzy words and some morphic images of them, have the WELLDOC property. Using the TestU01 and PractRand statistical tests, we moreover show that not only the lattice structure is absent, but also other important properties of PRNGs are improved when linear congruential generators are combined using infinite words having the WELLDOC property.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GA13-03538S" target="_blank" >GA13-03538S: Algorithms, Dynamics and Geometry of Numeration systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)