Bounds on the weighted path length of binary trees☆

https://doi.org/10.1016/0020-0190(72)90015-4Get rights and content

First page preview

First page preview
Click to open first page preview
View PDF

References (7)

  • R.G. Gallager

    Information Theory and Reliable Communication

    (1968)
  • T.C. Hu et al.

    Optimal Computer Search Trees and Variable-length Alphabetic Codes

    SIAM J. Applied Math

    (1971)
  • D.A. Huffman

    A Method for the Construction of Minimum Redundancy Codes

    Proc. IRE

    (1952)
There are more references available in the full text version of this article.

Cited by (0)

☆

This work was supported in part by the National Science Foundation (Grant GJ-31222), and in part by IBM Corporation.

View full text
Copyright © 1972 Published by Elsevier B.V.