Abstract
In this article, a new algorithm generating discrete uniform distribution on n elements from a binary random source is proposed by introducing the notion of coprimity and modulo function in number theory. The algorithm is a generalization of Von Neumann’s algorithm for [4] and Dijkstra’s algorithm for prime n [1]. The proof for the validity of the algorithm introduces the notion of random variable in residual classes, and combines the ideas and techniques from both probability theory and number theory.
Citation
Xiaoyu Lei. "Generating discrete uniform distribution from a biased coin using number-theoretic method." Electron. Commun. Probab. 28 1 - 6, 2023. https://doi.org/10.1214/23-ECP537