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 has

• Type: Conference
• Year: 2006
• Where: DCC
• Authors: Sorina Dumitrescu
• Keywords: Computer Graphics, DCC 2006, Letter Cost, Time Complexity, Unequal Integer Letter