A new method for constructing minimum-redundancy prefix codes is described. This method does not build a Huffman tree; instead it uses a property of optimal codes to find the codeword length of each weight. The running time of the algorithm is shown to be O(nk), where n is the number of weights and k is the number of different codeword lengths. When the given sequence k weights is already sorted, it is shown that the codes can be constructed using O(log 2k-1 n) comparisons, which is sub-linear if the value of k is small. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Belal, A., & Elmasry, A. (2006). Distribution-sensitive construction of minimum-redundancy prefix codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3884 LNCS, pp. 92–103). https://doi.org/10.1007/11672142_6
Mendeley helps you to discover research relevant for your work.