2014/12/23 by Bernhard Ömer, Ömer, Bernhard, Christoph Pacher +1 · 1 citation
Computer Science · Mathematics · #Advanced Data Storage Technologies #Algorithms and Data Compression #Artificial Intelligence in Games #Cellular Automata and Applications #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1412.7407
5 pages
arxiv created 2014/12/23 · openalex publication_date 2014/12/23 · arxiv updated 2014/12/24 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
We give an implementation of an algorithm that uses fair coin flips to simulate fair rolls of an n-sided die. A register plays the role of an entropy pool and holds entropy that is generated as a by-product during each die roll and that is usually discarded. The entropy stored in this register is completely reused during the next rolls. Consequently, we can achieve an almost negligible loss of entropy per roll. The algorithm allows to change the number of sides of the die in each round. We prove that the entropy loss is monotone decreasing with increasing entropy pool size (register length).