Sciweavers

3 search results - page 1 / 1
» Huffman coding with unequal letter costs
Sort
View
STOC
2002
ACM
96views Algorithms» more  STOC 2002»
16 years 4 months ago
Huffman coding with unequal letter costs
Mordecai J. Golin, Claire Kenyon, Neal E. Young
DCC
2006
IEEE
15 years 8 months ago
Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
Sorina Dumitrescu
114
Voted
ISAAC
2007
Springer
98views Algorithms» more  ISAAC 2007»
15 years 10 months ago
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
Mordecai J. Golin, Jian Li