Sundaresan, Rajesh (2007) Guessing Under Source Uncertainty. In: IEEE Transactions on Information Theory, 53 (1). pp. 269-287.
Restricted to Registered users only
Download (473Kb) | Request a copy
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.
|Item Type:||Journal Article|
|Additional Information:||Copyright 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Keywords:||f-divergence;I-projection;Guessing;Information geometry;Mismatch;Pythagorean identity;Renyi entropy;Renyi information divergence;Redundancy;Side information|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||25 Aug 2008|
|Last Modified:||19 Sep 2010 04:34|
Actions (login required)