By Topic

A Dynamic Programming Approach to Length-Limited Huffman Coding: Space Reduction With the Monge Property

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

2 Author(s)
Golin, M. ; Dept. of Comput. Sci. & Eng., Hong Kong UST, Kowloon, China ; Yan Zhang

The “state-of-the-art” in length-limited Huffman coding (LLHC) algorithms is the Θ(nD)-time, Θ(n)-space one of Hirschberg and Larmore, where n is the size of the code and Dn is the length restriction on the codewords. This is a very clever, very problem specific, technique. This paper presents a simple dynamic-programming (DP) method that solves the problem with the same time and space bounds. The fact that there was an Θ(nD) time DP algorithm was previously known; it is a straightforward DP with the Monge property (which permits an order of magnitude speedup). It was not interesting, though, because it also required Θ(nD) space. The main result of this paper is the technique developed for reducing the space. It is quite simple and applicable to many other problems modeled by DPs with the Monge property. This is illustrated with examples from web-proxy design and wireless mobile paging.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 8 )