Generation of discrete distributions from biased coins

DOI10.1109/18.532895MaRDI QIDQ4896833zbMATH OpenOpenAlexFDO

Authors Julia Abrahams

Publication date 22 October 1996

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.532895

zbMATH Keywords

random number generationbiased coins\(t\)-ary expansionsunequal code symbol costs

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Linear codes (general theory) (94B05)

Recommendations

• From biased coin to any discrete distribution
• Tree algorithms for unbiased coin tossing with a biased coin
• Optimal random number generation from a biased coin
• Efficient generation of fair dice with few biased coins
• Randomizing Functions: Simulation of a Discrete Probability Distribution Using a Source of Unknown Distribution

Cited in

(11)

• Generating discrete uniform distribution from a biased coin using number-theoretic method
• Optimal random number generation from a biased coin
• A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models
• On distributions computable by random walks on graphs
• The complexity of generating an exponentially distributed variate
• On Distributions Computable by Random Walks on Graphs
• Randomizing Functions: Simulation of a Discrete Probability Distribution Using a Source of Unknown Distribution
• Efficient simulations by a biased coin
• Tree algorithms for unbiased coin tossing with a biased coin
• From biased coin to any discrete distribution
• An optimal algorithm for simulation of true die by symmetric coin

This page was built for publication: Generation of discrete distributions from biased coins

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