3 papers
cs.DS2008
A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding
Mordecai Golin, Xiaoming Xu, Jiajin Yu
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 ba…
cs.DS2008
A Dynamic Programming Approach To Length-Limited Huffman Coding
Mordecai Golin, Yan Zhang
The ``state-of-the-art'' in Length Limited Huffman Coding algorithms is the -time, -space one of Hirschberg and Larmore, where is the length restriction on th…
cs.IT2007
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
Mordecai Golin, Li Jian
There is a large literature devoted to the problem of finding an optimal (min-cost) prefix-free code with an unequal letter-cost encoding alphabet of size. While there is no known…