Iterating von Neumann's procedure for extracting random bits
From MaRDI portal
Publication:1192995
DOI10.1214/aos/1176348543zbMath0754.60040OpenAlexW1987434335WikidataQ55924085 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
exchangeabilityexchangeable processesKeane-Smorodinsky finitary codesnumber of unbiased bitsrandom biased bits
Signal detection and filtering (aspects of stochastic processes) (60G35) Measures of information, entropy (94A17) Exchangeability for stochastic processes (60G09)
Related Items (18)
Randomness extraction in computability theory ⋮ ASYMPTOTIC ANALYSIS OF PERES’ ALGORITHM FOR RANDOM NUMBER GENERATION ⋮ Heat-Bath Algorithmic Cooling with Correlated-Qubits Relaxation ⋮ Extraction rates of random continuous functionals ⋮ New coins from old, smoothly ⋮ Non-contextual chocolate balls versus value indefinite quantum cryptography ⋮ Quantum Random Number Generation ⋮ An Introduction to Randomness Extractors ⋮ Proved Random Numbers Obtained from Hardware Devices ⋮ Optimal Coin Flipping ⋮ A quantum random number generator certified by value indefiniteness ⋮ An asymptotically optimal Bernoulli factory for certain functions that can be expressed as power series ⋮ Fast simulation of new coins from old ⋮ Simulating events of unknown probabilities via reverse time martingales ⋮ Coalgebraic tools for randomness-conserving protocols ⋮ Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators ⋮ Universal finitary codes with exponential tails ⋮ Some factors of nonsingular Bernoulli shifts
This page was built for publication: Iterating von Neumann's procedure for extracting random bits