Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/6588

A generic top-down dynamic-programming approach to prefix-free coding

Authors Golin, M.
Xu, X.
Yu, J.
Issue Date 2009
Source Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms , 2009, p. 758-767
Summary Given a probability distribution over a set of n words to be transmitted, the Huffman Coding problem is to find a minimal-cost prefix free code for transmitting those words. The basic Huffman coding problem can be solved in O(n log n) time but variations are more difficult. One of the standard techniques for solving these variations utilizes a top-down dynamic programming approach. In this paper we show that this approach is amenable to dynamic programming speedup techniques, permitting a speedup of an order of magnitude for many algorithms in the literature for such variations as mixed radix, reserved length and one-ended coding. These speedups are immediate implications of a general structural property that permits batching together the calculation of many DP entries. Copyright © by SIAM.
Subjects
ISBN 9780898716801
Rights Copyright © SIAM. This paper is made available with permission of the Society for Industrial and Applied Mathematics for limited noncommerical distribution only.
Language English
Format Conference paper
Access View full-text via Scopus
Files in this item:
File Description Size Format
gener.pdf 410598 B Adobe PDF