Peres-Style Recursive Algorithms

05/11/2018
by   Sung-il Pae, et al.
0

Peres algorithm applies the famous von Neumann trick recursively to produce unbiased random bits from biased coin tosses. Its recursive nature makes the algorithm simple and elegant, and yet its output rate approaches the information-theoretic upper bound. However, it is relatively hard to explain why it works, and it appears partly due to this difficulty that its generalization to many-valued source was discovered only recently. Binarization tree provides a new conceptual tool to understand the innerworkings of the original Peres algorithm and the recently-found generalizations in both aspects of the uniform random number generation and asymptotic optimality. Furthermore, it facilitates finding many new Peres-style recursive algorithms that have been arguably very hard to come by without this new tool.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/17/2022

A recursive function coding number theoretic functions

We show that there exists a fixed recursive function e such that for all...
research
06/02/2023

Broadcasting in random recursive dags

A uniform k-dag generalizes the uniform random recursive tree by picking...
research
07/29/2022

Archaeology of random recursive dags and Cooper-Frieze random networks

We study the problem of finding the root vertex in large growing network...
research
01/07/2020

A Behavioural Theory of Recursive Algorithms

“What is an algorithm?” is a fundamental question of computer science. G...
research
11/20/2018

Improved Quantum Multicollision-Finding Algorithm

The current paper improves the number of queries of the previous quantum...
research
10/05/2020

Optimal bounds for approximate counting

Storing a counter incremented N times would naively consume O(log N) bit...
research
01/07/2021

A generalization of the Von Neumann extractor

An iterative randomness extraction algorithm which generalized the Von N...

Please sign up or login with your details

Forgot password? Click here to reset