Optimal random number generation from a biased coin
From MaRDI portal
Recommendations
Cited in
(21)- Efficient simulations by a biased coin
- Pseudo random coins show more heads than tails
- An optimal algorithm for simulation of true die by symmetric coin
- Exact output rate of Peres's algorithm for random number generation
- From biased coin to any discrete distribution
- Von Neumann's biased coin revisited
- Bad and Good Ways of Post-processing Biased Physical Random Numbers
- Randomizing Functions: Simulation of a Discrete Probability Distribution Using a Source of Unknown Distribution
- Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators
- scientific article; zbMATH DE number 1303578 (Why is no real title available?)
- Source codes as random number generators
- Extraction of optimally unbiased bits from a biased source
- Fast and efficient construction of an unbiased random sequence
- scientific article; zbMATH DE number 4117876 (Why is no real title available?)
- Generation of discrete distributions from biased coins
- scientific article; zbMATH DE number 5589306 (Why is no real title available?)
- Optimal coin flipping
- Coalgebraic tools for randomness-conserving protocols
- An efficient method for generating a discrete uniform distribution using a biased random source
- Generating discrete uniform distribution from a biased coin using number-theoretic method
- Tree algorithms for unbiased coin tossing with a biased coin
This page was built for publication: Optimal random number generation from a biased coin
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921780)
