|
1. |
Near-optimal depth-constrained codes
Gupta, P.; Prabhakar, B.; Boyd, S.;
Information Theory, IEEE Transactions on
Volume 50,
Issue 12,
Dec. 2004
Page(s):3294
-
3298
Abstract:
This note considers an n-letter alphabet in which the ith letter is accessed with probability p/sub i/. 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/sup */=(q/sup *//sub 1/,...,q/sup *//sub n/) in an appropriate convex set, S, so as to minimize the relative entropy D(p/spl par/q) over all q/spl isin/S. Methods from convex optimization give an explicit solution for q/sup */ 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.
|
Cart
