Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters
Journal of the ACM (JACM)
Two applications of a probabilistic search technique: Sorting X+Y and building balanced search trees
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Huffman coding with unequal letter costs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Trees with exponentially growing costs
Information and Computation
More efficient algorithms and analyses for unequal letter cost prefix-free coding
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Note: On the construction of prefix-free and fix-free codes with specified codeword compositions
Discrete Applied Mathematics
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 | 0.00 |