Abstract
Peres's algorithm produces unbiased random bits from biased coin tosses, recursively, using the famous von Neumann's method as its base. The algorithm is simple and elegant, but, at first glance, appears to work almost like magic and its generalization is elusive. We generalize the method to generate unbiased random bits from loaded dice, i.e., many-valued Bernoulli source. The generalization is asymptotically optimal in its output rate as is the original Peres's algorithm. Three-valued case is discussed in detail, and then other many-faced cases are considered.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.