Exact Output Rate of Generalized Peres Algorithm for Generating Random Bits from Loaded Dice
نویسندگان
چکیده
منابع مشابه
Exact Output Rate of Generalized Peres Algorithm for Generating Random Bits from Loaded Dice
We report a computation of the exact output rate of recently-discovered generalization of Peres algorithm for generating random bits from loaded dice. Instead of resorting to brute-force computation for all possible inputs, which becomes quickly impractical as the input size increases, we compute the total output length on equiprobable sets of inputs by dynamic programming using a recursive for...
متن کاملOn Optimal Algorithms for Generating Random Bits from Loaded Dice
The problem of generating random bits from an arbitrary biased coin, dating back to von Neumann’s 1951 work, has been extensively studied. Specifically, given a fixed number of biased coin tosses with unknown probability, it is well known how to generate random bits with an asymptotically optimal efficiency. In this paper we address two basic questions related to the generation of random bits. ...
متن کاملA Universal Scheme for Transforming Binary Algorithms to Generate Random Bits from Loaded Dice
In this paper, we present a universal scheme for transforming an arbitrary algorithm for biased 2-face coins to generate random bits from the general source of an m-sided die, hence enabling the application of existing algorithms to general sources. In addition, we study approaches of efficiently generating a prescribed number of random bits from an arbitrary biased coin. This contrasts with mo...
متن کاملEfficiently Generating Random Bits from Finite State Markov Chains
The problem of random number generation from an uncorrelated random source (of unknown probability distribution) dates back to von Neumann’s 1951 work. Elias (1972) generalized von Neumann’s scheme and showed how to achieve optimal efficiency in unbiased random bits generation. Hence, a natural question is what if the sources are correlated? Both Elias and Samuelson proposed methods for generat...
متن کاملGenerating random bits from an arbitrary source: fundamental limits
Suppose we are given a random source and want to use it as a random number gene.rator; at what rate can we generate fair bits from it? We address this question in an informationtheoretic setting by allowing for some arbitrarily small but nonzero deviation from “ideal” random bits. We prove our results with three different measures of approximation between the ideal and the obtained probability ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2013
ISSN: 2158-107X,2156-5570
DOI: 10.14569/ijacsa.2013.040731