Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes

  • Ahmed Belal
  • Amr Elmasry
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3884)

Abstract

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 of weights is already sorted, it is shown that the codes can be constructed using O(log2k− 1n) comparisons, which is sub-linear if the value of k is small.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ahmed Belal
    • 1
  • Amr Elmasry
    • 1
  1. 1.Department of Computer Engineering and InformaticsBeirut Arab UniversityLebanon

Personalised recommendations