• DocumentCode
    932201
  • Title

    An efficient algorithm for constructing nearly optimal prefix codes

  • Author

    Mehlhorn, Kurt

  • Volume
    26
  • Issue
    5
  • fYear
    1980
  • fDate
    9/1/1980 12:00:00 AM
  • Firstpage
    513
  • Lastpage
    517
  • Abstract
    A new algorithm is presented for constructing nearly optimal prefix codes in the case of unequal letter costs and unequal probabilities. A bound on the maximal deviation from the optimum is derived and numerical examples are given. The algorithm has running time O(t \\cdot n) , where t is the number of letters and n is the number of probabilities.
  • Keywords
    Coding; Algorithm design and analysis; Calculus; Cost function; Entropy; Equations; Linear programming; Probability distribution;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1980.1056250
  • Filename
    1056250
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=932201