By Topic

An algorithm for generating n Huffman codes with a worst case of (n log2 n+n log2 log2 n) comparisons

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ghim Hwee Ong ; Dept. of Inf. Syst. & Comput. Sci., Nat. Univ. of Singapore, Singapore

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

Published in:

Networks, 1993. International Conference on Information Engineering '93. 'Communications and Networks for the Year 2000', Proceedings of IEEE Singapore International Conference on  (Volume:2 )

Date of Conference:

6-11 Sep 1993