Codes : Unequal probabilities, unequal letter costs

  • Doris Altenkamp
  • Kurt Mehlhorn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 62)


Construction Process Code Word Optimal Code Unequal Probability Bell System Technical Journal 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Ash: Information Theory, Interscience Publishers, N.Y., 1965Google Scholar
  2. [2]
    Bayer, P.: Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees, to appear in Acta Informatica.Google Scholar
  3. [3]
    Fredman, M.L.: Two Applications of a Probabilistic Search Technique, ACM Conf. on Theory of Computing, 1975.Google Scholar
  4. [4]
    Gilbert, E.N. & Moore, E.F.: Variable Length Encordings, Bell System Technical Journal, 1971.Google Scholar
  5. [5]
    Hu, T.C. & Tucker, A.C.: Optimal Computer Search Trees and Variable Length Alphabetic Codes, SIAM J. Appl. Math. 21, 1971.Google Scholar
  6. [6]
    Huffmann, D.A.: A Method for the Construction of Minimum-Redundancy Codes, Proc. IRE 40, 1098–1101, 1952Google Scholar
  7. [7]
    Itai, A.: Optimal Alphabetic Trees, SIAM J. Computing, 9–18, March 1976.Google Scholar
  8. [8]
    Karp, R.M.: Minimum Redundancy Coding for the Discrete Noiseless Channel.Google Scholar
  9. [9]
    Mehlhorn, K.: Effiziente Algorithmen, Teubner Studienbücher Informatik, Stuttgart, 1977.Google Scholar
  10. [10]
    Mehlhorn, K.: Best Possible Bounds on the Weighted Path Length of Optimum Binary Search Trees, SIAM J. of Comp. Vol. 6, No. 2, 1977Google Scholar
  11. [11]
    Perl, Y. & Garey, M.R. & Even, S.: Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letter, JACM, Vol. 22 No. 2, 202–214, April 1975.CrossRefGoogle Scholar
  12. [12]
    v. Leuwen, J.: On the construction of Huffmann trees, 3rd ICALP (1976), 382–410.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • Doris Altenkamp
    • 1
  • Kurt Mehlhorn
    • 1
  1. 1.Fachbereich 10 — Universität des SaarlandesSaarbrückenWest Germany

Personalised recommendations