This paper studies the problem of simulating a coin of arbitrary real bias q with a coin of arbitrary real bias p with minimum loss of entropy. We establish a lower bound that is strictly greater than the information-theoretic bound. We show that as a function of q, it is an everywhere-discontinuous self-similar fractal. We provide efficient protocols that achieve the lower bound to within any desired accuracy for
CITATION STYLE
Kozen, D. (2014). Optimal coin flipping. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8464 LNCS, pp. 407–426). Springer Verlag. https://doi.org/10.1007/978-3-319-06880-0_21
Mendeley helps you to discover research relevant for your work.