JUCS - Journal of Universal Computer Science 3(7): 813-820, doi: 10.3217/jucs-003-07-0813
Optimum Huffman Forests
expand article infoIoan Tomescu‡
‡ Faculty of Mathematics, University of Bucharest, Romania

Corresponding author: Ioan Tomescu ( ioan@inf.math.unibuc.ro )

© Ioan Tomescu.
This article is freely available under the J.UCS Open Content License.
Citation: Tomescu I (1997) Optimum Huffman Forests. JUCS - Journal of Universal Computer Science 3(7): 813-820. https://doi.org/10.3217/jucs-003-07-0813
Open Access
Abstract
In this paper we solve the following problem: Given a positive integer f and L weights (real numbers), find a partition with f classes of the multiset of weights such that the sum of the costs of the optimum m-ary Huffman trees built for every class of is minimum. An application to the optimal extendibility problem for prefix codes is proposed. 1.)This work was done while the author has visited the Computer Science Department, University of Auckland, New Zealand.
Keywords
Kraft s inequality, optimum m-ary Huffman tree, weight set partition, optimal extendibility problem.