publication . External research report . 2010

Guessing and compression subject to distortion

Hanawal, Manjesh Kumar; Sundaresan, Rajesh;
Open Access
  • Published: 01 Jan 2010
  • Country: India
Abstract
The problem of guessing a random string is revisited. The relation-ship between guessing without distortion and compression is extended to the case when source alphabet size is countably in¯nite. Further, similar relationship is established for the case when distortion allowed by establishing a tight relationship between rate distortion codes and guessing strategies.
Subjects
ACM Computing Classification System: Data_MISCELLANEOUSData_CODINGANDINFORMATIONTHEORY
free text keywords: Electrical Communication Engineering

[1] E. Arikan and N. Merhav, \Guessing subject to distortion," IEEE Trans. Inf. Theory, vol. 44, pp. 1041{1056, May 1998. [OpenAIRE]

[2] E. Arikan, \An inequality on guessing and its application to sequential decoding," IEEE Trans. Inf. Theory, vol. 42, pp. 99{105, Jan. 1996. [OpenAIRE]

[3] J. L. Massey, \Guessing and entropy," in Proc. 1994 IEEE International Symposium on Information Theory, Trondheim, Norway, Jun. 1994, p. 204.

[4] R. Sundaresan, \Guessing based on length functions," in Proceedings of the Conference on Managing Complexity in a Distributed World, MCDES, Bangalore, India, May 2008; also available as DRDO-IISc Programme in Mathematical Engineering Technical Report No. TR-PME-2007-02, Feb. 2007. http://pal.ece.iisc.ernet.in/PAM/tech rep07/TR-PME-2007-02.pdf.

[5] L. L. Campbell, \A coding theorem and R¶enyi's entropy," Information and Control, vol. 8, pp. 423{429, 1965.

[6] M. K. Hanawal and R. Sundaresan, \Guessing revisited: A large deviations approach," in Proc. National Conference on Communications, Guwahati, India, Jan 2009.

Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue