By Topic

A Bound of Generalized Cutoff Rate for the Fixed-Length Lossy Coding of General Sources

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Shimokawa, H. ; Aihara Complexity Modelling Project, Japan Sci. & Technol. Agency, Tokyo

This paper investigate Csiszar's generalized cutoff rate for the fixed-length lossy coding of general sources. We obtain an upper bound of generalized cutoff rate and derive Renyi's entropy for the case of loss-less coding. We also derive generalized cutoff rate for memory-less sources with lossy coding. It can be considered as a lossy counterpart of Renyi's entropy.

Published in:

Information Theory, 2007. ISIT 2007. IEEE International Symposium on

Date of Conference:

24-29 June 2007