DCC '01 Proceedings of the Data Compression Conference
Algorithms for infinite huffman-codes
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Online prefix-free encoding algorithm
SPPRA'06 Proceedings of the 24th IASTED international conference on Signal processing, pattern recognition, and applications
A generic top-down dynamic-programming approach to prefix-free coding
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The structure of optimal prefix-free codes in restricted languages: the uniform probability case
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
| Hi-index | 754.84 |
The generic Huffman-encoding problem of finding a minimum cost prefix free code is almost completely understood. There still exist many variants of this problem which are not as well understood, though. One such variant, requiring that each of the codewords ends with “1”, has previously been introduced in the literature with the best algorithms known for finding such codes running in exponential time. We develop a simple O(n3) time algorithm for solving the problem