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 (28)
- Encoding Tasks and Rényi Entropy
- Multi-user guesswork and brute force security
- Guessing based on length functions
- A Characterization of Guesswork on Swiftly Tilting Curves
- Two Measures of Dependence
- A Scale-invariant Generalization of the Rényi Entropy, Associated Divergences and their Optimizations under Tsallis' Nonextensive Framework
- A tight uniform continuity bound for the Arimoto-Rényi conditional entropy and its extension to classical-quantum states
- Guesswork with Quantum Side Information
- Guesswork of a quantum ensemble
- Minimax Rényi Redundancy
- A precise bare simulation approach to the minimization of some distances. Foundations
- Some Useful Integral Representations for Information-Theoretic Analyses
- Guessing Revisited: A Large Deviations Approach
- Mismatched Guesswork
- Guessing with a Bit of Help
- A Unified Framework for Problems on Guessing, Source Coding and Task Partitioning
- Nonextensive Pythagoras' Theorem
- Distributed Task Encoding
- Codes for Tasks and Rényi Entropy Rate
- Guesswork Subject to a Total Entropy Budget
- Generalized Fisher-Darmois-Koopman-Pitman Theorem and Rao-Blackwell Type Estimators for Power-Law Distributions
- Cramér-Rao Lower Bounds Arising from Generalized Csiszár Divergences
- Password Cracking: The Effect of Hash Function Bias on the Average Guesswork
- On the Measurement attaining the Quantum Guesswork
- Reducing Guesswork via an Unreliable Oracle
- Design and Analysis of Stability-Guaranteed PUFs
- Projection Theorems of Divergences and Likelihood Maximization Methods
- Centralized vs Decentralized Targeted Brute-Force Attacks: Guessing with Side-Information