On the randomness of independent experiments

Simple item page
dc.creatorHolenstein, Thomas
dc.creatorRenner, Renato
dc.date2006-08-02
dc.date.accessioned2026-07-07T08:16:40Z
dc.date.available2026-07-07T08:16:40Z
dc.descriptionGiven a probability distribution P, what is the minimum amount of bits needed to store a value x sampled according to P, such that x can later be recovered (except with some small probability)? Or, what is the maximum amount of uniform randomness that can be extracted from x? Answering these and similar information-theoretic questions typically boils down to computing so-called smooth entropies. In this paper, we derive explicit and almost tight bounds on the smooth entropies of n-fold product distributions.
dc.descriptionlatex, 15 pages
dc.identifierhttps://arxiv.org/abs/cs/0608007
dc.identifierhttp://arxiv.org/abs/cs/0608007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133862
dc.subjectInformation Theory
dc.titleOn the randomness of independent experiments
dc.typetext

Files

Collections

arXiv