Sharp entropy bounds for discrete statistical simulation

DOI10.1016/S0167-7152(98)00174-6MaRDI QIDQ1962169zbMATH OpenFDO

Authors Dan Romik

Publication date 11 March 2001

Published in Statistics \& Probability Letters (Search for Journal in Brave)

zbMATH Keywords

entropydiscrete distributionsstatistical simulation

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Random number generation in numerical analysis (65C10)

Recommendations

• On Universal Simulation of Information Sources Using Training Data
• Simulation of random processes and rate-distortion theory
• Complexity of monotone algorithms for the simulation of discrete distributions
• Achievable Key Rates for Universal Simulation of Random Data With Respect to a Set of Statistical Tests
• scientific article; zbMATH DE number 4110061

Cites work

• scientific article; zbMATH DE number 3614066 (Why is no real title available?)
• Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
• The Efficient Construction of an Unbiased Random Sequence
• Tree algorithms for unbiased coin tossing with a biased coin

Cited in

(2)

• On the complexity of binary floating point pseudorandom generation
• Universal finitary codes with exponential tails

This page was built for publication: Sharp entropy bounds for discrete statistical simulation

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