Guessing under source uncertainty

IEEE Transactions on Information Theory

Volumn 53, Issue 1, 2007, Pages 269-287

  Sundaresan, Rajesh ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

f divergence; Guessing; I projection; Information geometry; Mismatch; Pythagorean identity; R nyi entropy; R nyi information divergence; Redundancy; Side information

Indexed keywords

CORRELATION THEORY; ENTROPY; GEOMETRY; UNCERTAIN SYSTEMS;

FINITE ALPHABET; INFORMATION GEOMETRY; KULLBACK-LEIBLER DIVERGENCE; PYTHAGOREAN PROPERTY; SIDE INFORMATION;

INFORMATION THEORY;

EID: 33846089260     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.887466     Document Type: Article

References (23)

1. J. L. Massey, "Guessing and entropy," in Proc. 1994 IEEE Int. Symp. Inf. Theory, Trondheim, Norway, Jun. 1994, p. 204.
2. E. Arikan, "An inequality on guessing and its application to sequential decoding," IEEE Trans. Inf. Theory, vol. IT-42, pp. 99-105, Jan. 1996.
3. N. Merhav and E. Arikan, "The Shannon cipher system with a guessing wiretapper," IEEE Trans. Inf. Theory, vol. 45, pp. 1860-1866, Sep. 1999.
4. S. Boztas,, "Comments on "An inequality on guessing and its application to sequential decoding"," IEEE Trans. Inf. Theory, vol. 43, pp. 2062-2063, Nov. 1997.
5. I. Csiszár, "I-divergence geometry of probability distributions and minimization problems," Ann. Prob., vol. 3, pp. 146-158, 1975.
6. E. Arikan and N. Merhav, "Guessing subject to distortion," IEEE Trans. Inf. Theory, vol. IT-44, pp. 1041-1056, May 1998.
7. L. L. Campbell, "A coding theorem and Rényi's entropy," Inf. Contr., vol. 8, pp. 423-429, 1965.
8. L. L. Campbell, "Definition of entropy by means of a coding problem," Z. Wahrscheinlichkeitstheorie verw. Geb., vol. 6, pp. 113-118, 1966.
9. A. C. Blumer and R. J. McEliece, "The Rényi redundancy of generalized Huffman codes," IEEE Trans. Inf. Theory, vol. 34, pp. 1242-1249, Sep. 1988.
10. T. R. M. Fischer, "Some remarks on the role of inaccuracy in Shannon's theory of information transmission," in Proc. Trans. 8th Prague Conf. Inf. Theory, 1978, pp. 211-226.
11. L. D. Davisson, "Universal noiseless coding," IEEE Trans. Inf. Theory, vol. IT-19, pp. 783-795, Nov. 1972.
12. R. G. Gallager, "Source Coding with Side Information and Universal Coding," Technical Report LIDS, LIDS-P-937, 1979.
13. L. D. Davisson and A. Leon-Garcia, "A source matching approach to finding minimax codes," IEEE Trans. Inf. Theory, vol. IT-26, pp. 166-174, Mar. 1980.
14. R. Sundaresan, "A measure of discrimination and its geometric properties," in Proc. 2002 IEEE Int. Symp. Inf. Theory, Lausanne, Switzerland, Jun. 2002, p. 264.
15. I. Csiszár, "Generalized cutoff rates and Rényi's information measures," IEEE Trans. Inf. Theory, vol. IT-41, pp. 26-34, Jan. 1995.
16. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
17. I. Csiszár, "A class of measures of informativity of observation channels," Periodica Mathematica Hungarica, vol. 2, pp. 191-213, 1972.
18. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
19. S. Arimoto, "On the converse to the coding theorem for discrete memoryless channels," IEEE Trans. Inf. Theory, vol. IT-19, pp. 357-359, May 1973.
20. Q. Xie and A. R. Barron, "Asymptotic minimax regret for data compression, gambling, and prediction," IEEE Trans. Inf. Theory, vol. IT-46, pp. 431-445, Mar. 2000.
21. N. Merhav and M. Feder, "A strong version of the redundancy-capacity theorem of universal coding," IEEE Trans. Inf. Theory, vol. IT-41, pp. 714-722, May 1995.
22. M. Feder and N. Merhav, "Hierarchical universal coding," IEEE Trans. Inf. Theory, vol. IT-42, pp. 1354-1364, Sep. 1996.
23. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd ed. Budapest, Hungary: Academic, 1986.