Computer Science – Information Theory
Scientific paper
2010-08-21
Computer Science
Information Theory
Scientific paper
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this problem can be reduced to the covering problem for the unit simplex. This setting yields precise asymptotic characterization in the high-rate regime. We also describe a simple and asymptotically optimal algorithm for solving this problem. Performance of this algorithm is studied and compared with several known solutions.
No associations
LandOfFree
Quantization of Discrete Probability Distributions 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 Quantization of Discrete Probability Distributions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantization of Discrete Probability Distributions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-188756