Computer Science – Information Theory
Scientific paper
2006-08-02
Computer Science
Information Theory
latex, 15 pages
Scientific paper
Given 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.
Holenstein Thomas
Renner Renato
No associations
LandOfFree
On the randomness of independent experiments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the randomness of independent experiments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the randomness of independent experiments will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-264537