By Topic

Near-optimal depth-constrained codes

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

3 Author(s)
Gupta, P. ; Cypress Semicond., Palo Alto, CA, USA ; Prabhakar, B. ; Boyd, S.

This note considers an n-letter alphabet in which the ith letter is accessed with probability pi. The problem is to design efficient algorithms for constructing near-optimal, depth-constrained Huffman and alphabetic codes. We recast the problem as one of determining a probability vector q*=(q*1,...,q*n) in an appropriate convex set, S, so as to minimize the relative entropy D(p||q) over all q∈S. Methods from convex optimization give an explicit solution for q* in terms of p. We show that the Huffman and alphabetic codes so constructed are within 1 and 2 bits of the corresponding optimal depth-constrained codes.

Published in:

Information Theory, IEEE Transactions on  (Volume:50 ,  Issue: 12 )