By Topic

The minimum achievable redundancy rate of fixed-to-fixed length source codes for 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
$33 $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

2 Author(s)
Arimura, M. ; Dept. of Appl. Comput. Sci., Shonan Inst. of Technol., Fujisawa, Japan ; Iwata, K.

This paper investigates the minimum achievable redundancy rate of fixed-to-fixed length lossless source codes (FF codes) for general sources. This paper defines the redundancy rate of the FF code by the difference between the coding rate and the self information rate. We prove that the minimum achievable redundancy rate is equal to the limit superior in probability of the width of the information spectrum, which is defined in this paper. This paper also considers the ε-source coding. We show two criteria for bounding the error probability. The first one bounds the sum of the decoding error probability and the redundancy-overflow probability, and the other one bounds these two probabilities separately. We also give the minimum achievable redundancy rate of these two types of ε-source coding.

Published in:

Information Theory and its Applications (ISITA), 2010 International Symposium on

Date of Conference:

17-20 Oct. 2010