Journal article
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 O(n^{C+2}) time complexity, where n is the number of codewords and C is the maximum letter cost. For the special case when the encoding alphabet is binary, a faster solution was proposed, namely of O(n^C) time complexity, based on a more sophisticated modeling of the problem, …
Authors
Dumitrescu S
Journal
Fundamenta Informaticae, Vol. 73, No. 1-2, pp. 107–117
DOI
10.3233/fun-2006-731-210
ISSN
0169-2968