Iterating von Neumann's procedure for extracting random bits
From MaRDI portal
Publication:1192995
DOI10.1214/aos/1176348543zbMath0754.60040WikidataQ55924085 ScholiaQ55924085MaRDI QIDQ1192995
Publication date: 27 September 1992
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1176348543
exchangeability; exchangeable processes; Keane-Smorodinsky finitary codes; number of unbiased bits; random biased bits
60G35: Signal detection and filtering (aspects of stochastic processes)
94A17: Measures of information, entropy
60G09: Exchangeability for stochastic processes
Related Items
Some factors of nonsingular Bernoulli shifts, ASYMPTOTIC ANALYSIS OF PERES’ ALGORITHM FOR RANDOM NUMBER GENERATION, Heat-Bath Algorithmic Cooling with Correlated-Qubits Relaxation, Simulating events of unknown probabilities via reverse time martingales, Proved Random Numbers Obtained from Hardware Devices, Optimal Coin Flipping, A quantum random number generator certified by value indefiniteness, Coalgebraic tools for randomness-conserving protocols, Randomness extraction in computability theory, Extraction rates of random continuous functionals, Non-contextual chocolate balls versus value indefinite quantum cryptography, New coins from old, smoothly, Fast simulation of new coins from old, An asymptotically optimal Bernoulli factory for certain functions that can be expressed as power series, An Introduction to Randomness Extractors, Quantum Random Number Generation, Universal finitary codes with exponential tails, Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators
