Title :
An algorithm for generating n Huffman codes with a worst case of (n log2 n+n log2 log2 n) comparisons
Author_Institution :
Dept. of Inf. Syst. & Comput. Sci., Nat. Univ. of Singapore, Singapore
Abstract :
The method is based on a Heapsort algorithm for sorting a sequence of n data elements with a worst case of (n log2 n+n log2 log2 n) comparisons. The idea of heap restoring in the Heapsort algorithm is incorporated into the Huffman tree building process. The performance of the proposed algorithm in execution time is evaluated with a list of ordered, random, and reverse ordered data containing from 5000 to 500000 items
Keywords :
Huffman codes; computational complexity; sorting; tree data structures; Heapsort algorithm; Huffman codes; Huffman tree building; execution time; heap restoring; sorting; Binary trees; Computer aided software engineering; Computer science; Costs; Encoding; Entropy; Frequency; Huffman coding; Information systems; Sorting;
Conference_Titel :
Networks, 1993. International Conference on Information Engineering '93. 'Communications and Networks for the Year 2000', Proceedings of IEEE Singapore International Conference on
Print_ISBN :
0-7803-1445-X
DOI :
10.1109/SICON.1993.515711
