Dichotomic random number generators
Josef Eschgf\"aller, Andrea Scarpante
TL;DR
This paper introduces new classes of pseudorandom sequences derived from labeled binary trees, extending classical random number generation methods, with potential implications for improved randomness in computational applications.
Contribution
It presents novel pseudorandom sequence constructions based on generalized Stern-Brocot trees, expanding the theoretical framework of random number generation.
Findings
New classes of pseudorandom sequences introduced
Sequences derived from generalized Stern-Brocot trees
Potential for enhanced randomness properties
Abstract
We introduce several classes of pseudorandom sequences which represent a natural extension of classical methods in random number generation. The sequences are obtained from constructions on labeled binary trees, generalizing the well-known Stern-Brocot tree.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption · Cellular Automata and Applications · Algorithms and Data Compression