Guessing under source uncertainty
arXiv:cs/0603064 · doi:10.1109/TIT.2006.887466
Abstract
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.
27 pages, submitted to IEEE Transactions on Information Theory, March 2006, revised September 2006, contains minor modifications and restructuring based on reviewers' comments
Cited by in corpus (12)
- A precise bare simulation approach to the minimization of some distances. Foundations
- Some Useful Integral Representations for Information-Theoretic Analyses
- Mismatched Guesswork
- Guessing Revisited: A Large Deviations Approach
- A Unified Framework for Problems on Guessing, Source Coding and Task Partitioning
- Nonextensive Pythagoras' Theorem
- Guesswork Subject to a Total Entropy Budget
- Generalized Fisher-Darmois-Koopman-Pitman Theorem and Rao-Blackwell Type Estimators for Power-Law Distributions
- Design and Analysis of Stability-Guaranteed PUFs
- On the Measurement attaining the Quantum Guesswork
- Projection Theorems of Divergences and Likelihood Maximization Methods
- Centralized vs Decentralized Targeted Brute-Force Attacks: Guessing with Side-Information