节省小数位:一种实用的公平模辊熵有效编码
Saving fractional bits: A practical entropy efficient code for fair die rolls
摘要:
我们给出了一个算法的实现,该算法使用公平的硬币翻转来模拟公平的$n$侧模具辊。寄存器扮演熵池的角色,并保存在每个骰子滚动期间作为副产品产生的熵,并且通常被丢弃。存储在该寄存器中的熵在下一次滚动期间完全重复使用。因此,我们可以实现几乎可以忽略不计的熵损失每卷。该算法允许在每轮中改变骰子的边数。我们证明了熵损失是单调递减的熵池大小(寄存器长度)。
英文摘要:
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).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。