The Efficient Construction of an Unbiased Random Sequence

DOI10.1214/AOMS/1177692552MaRDI QIDQ5657582zbMATH OpenOpenAlexFDO

Authors Peter Eliaš

Publication date 1972

Published in Annals of Mathematical Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aoms/1177692552

Mathematics Subject Classification ID

Signal detection and filtering (aspects of stochastic processes) (60G35) Inference from stochastic processes and prediction (62M20) Random number generation in numerical analysis (65C10)

Cited in

(25)

• Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
• Fast simulation of new coins from old
• Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
• Simulating BPP using a general weak random source
• Sharp entropy bounds for discrete statistical simulation
• An asymptotically optimal Bernoulli factory for certain functions that can be expressed as power series
• From biased coin to any discrete distribution
• How to extract useful randomness from unreliable sources
• An introduction to randomness extractors
• Universal finitary codes with exponential tails
• Non-contextual chocolate balls versus value indefinite quantum cryptography
• Simulation of a random variable and its application to game theory
• ASYMPTOTIC ANALYSIS OF PERES’ ALGORITHM FOR RANDOM NUMBER GENERATION
• Optimal coin flipping
• A survey of max-type recursive distributional equations
• Randomness extraction in computability theory
• Coalgebraic tools for randomness-conserving protocols
• 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
• Sinai factors of nonsingular systems: Bernoulli shifts and Anosov flows
• Constructions of plateaued correctors with high correction order and good nonlinearity via Walsh spectral neutralization technique
• On the extraction of random bit sequences in quantum random number generators with several independent Markov sources
• Channel simulation: theory and applications to lossy compression and differential privacy
• A quantum-inspired post-processing method using collaborative mapping operators for random numbers and its application in image encryption
• Asymptotically optimal perfect steganographic systems

This page was built for publication: The Efficient Construction of an Unbiased Random Sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5657582)