Computer Science – Information Theory
Scientific paper
2006-03-16
Computer Science
Information Theory
27 pages, submitted to IEEE Transactions on Information Theory, March 2006, revised September 2006, contains minor modificatio
Scientific paper
10.1109/TIT.2006.887466
This paper considers the problem of guessing the realization of a finite alphabet source when some side information is provided. The only knowledge the guesser has about the source and the correlated side information is that the joint source is one among a family. A notion of redundancy is first defined and a new divergence quantity that measures this redundancy is identified. This divergence quantity shares the Pythagorean property with the Kullback-Leibler divergence. Good guessing strategies that minimize the supremum redundancy (over the family) are then identified. The min-sup value measures the richness of the uncertainty set. The min-sup redundancies for two examples - the families of discrete memoryless sources and finite-state arbitrarily varying sources - are then determined.
No associations
LandOfFree
Guessing under source uncertainty 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 Guessing under source uncertainty, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Guessing under source uncertainty will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-481072