The Efficient Construction of an Unbiased Random Sequence
From MaRDI portal
Publication:5657582
DOI10.1214/aoms/1177692552zbMath0245.65003OpenAlexW2150477349MaRDI QIDQ5657582
Publication date: 1972
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177692552
Inference from stochastic processes and prediction (62M20) Signal detection and filtering (aspects of stochastic processes) (60G35) Random number generation in numerical analysis (65C10)
Related Items (20)
Randomness extraction in computability theory ⋮ ASYMPTOTIC ANALYSIS OF PERES’ ALGORITHM FOR RANDOM NUMBER GENERATION ⋮ Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources ⋮ Simulating BPP using a general weak random source ⋮ Unconditionally secure short key ciphers based on data compression and randomization ⋮ An efficient method for generating a discrete uniform distribution using a biased random source ⋮ Sharp entropy bounds for discrete statistical simulation ⋮ Non-contextual chocolate balls versus value indefinite quantum cryptography ⋮ An Introduction to Randomness Extractors ⋮ Optimal Coin Flipping ⋮ An asymptotically optimal Bernoulli factory for certain functions that can be expressed as power series ⋮ A survey of max-type recursive distributional equations ⋮ Fast simulation of new coins from old ⋮ Coalgebraic tools for randomness-conserving protocols ⋮ Asymptotically optimal perfect steganographic systems ⋮ From biased coin to any discrete distribution ⋮ How to extract useful randomness from unreliable sources ⋮ Independent unbiased coin flips from a correlated biased source - a finite state Markov chain ⋮ Simulation of a Random Variable and its Application to Game Theory ⋮ Universal finitary codes with exponential tails
This page was built for publication: The Efficient Construction of an Unbiased Random Sequence
