By Topic

The Minimum Average Code for Finite Memoryless Monotone 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

4 Author(s)
Khosravifard, M. ; Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol. ; Saidi, H. ; Esmaeili, M. ; Gulliver, T.A.

The problem of selecting a code for finite monotone sources with N symbols is considered. The selection criterion is based on minimizing the average redundancy (called Minave criterion) instead of its maximum (i.e., Minimax criterion). The average probability distribution PNmacr, whose associated Huffman code has the minimum average redundancy, is derived. The entropy of the average distribution (i.e., H(PNmacr)) and the average entropy of the monotone distributions (i.e., H(PNmacr)) are studied. It is shown that both logN-H(PNmacr) and logN-H(PNmacr) are asymptotically equal to a constant (sime0.61). Therefore, there is only a negligible penalty (at most 1.61 bits/symbol) in using a simple fixed-length code with respect to the optimal code. An efficient near-optimal encoding technique is also proposed. The consequences of the two approaches, i.e., Minave and Minimax, are compared in terms of their associated distributions and associated codes. In order to evaluate the average performance of the Minimax code, we prove that the informational divergence of the average distribution and Minimax distribution asymptotically grows as -2.275+loglogN

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 3 )