Skip to main content
SpringerLink
Log in

Mixed-Radix Huffman Codes

  • Chapter
Computer Science

Abstract

A mixed-radix code tree is a tree in which the degree of an internal node may depend on the level of the node. The problem of finding mixed-radix trees with minimum weighted path length is reduced to the construction of optimal alphabetic mixed-radix trees. A dynamic programming algorithm is described whose running time is 0(n 4 log n) and storage requirements are 0(n3 log n).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Gilbert, E.N. and Moore, E.F., (atVariable-length binary encodings, Bell System Technical Journal, vol. 38, no. 4, pp. 933–968 (1959).

    MathSciNet  Google Scholar 

  • Gotlieb L., (atOptimal multi-way search trees, SIAM Journal on Computing, vol. 10, no. 3, pp. 422–433 (1981).

    Article  MathSciNet  MATH  Google Scholar 

  • Hu, T.C. and Tucker, A.C., (atOptimum computer search trees, SIAM Journal on Applied Mathematics, vol. 21, no. 4, pp. 514–532 (1971).

    Article  MathSciNet  MATH  Google Scholar 

  • Huffman, D.A., (atA method for the construction of minimum redundancy codes, Proceedings of the IRE, vol. 40, no. 9, pp. 1098–1101 (1952).

    Article  Google Scholar 

  • Itai A., (atOptimal alphabetic trees, SI AM Journal on Computing, vol. 5, no. 1, pp. 9–18 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  • Knuth, D.E., (atOptimal binary search trees, Acta Informatica, vol. 1, no. 1, pp. 14–25 (1971).

    Article  MATH  Google Scholar 

  • Knuth, D.E., “(atThe Art of Computer Programming,” vol. 2, Addison-Wesley, Reading, Massachusetts (1969).

    Google Scholar 

  • Lawler E., (atpersonal communication (1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Advanced Technology Group, Apple Computer, Inc., 20450 Stevens Creek Blvd., Cupertino, CA, 95014, USA

    Ke-Chiang Chu

  2. Electrical Engineering Department, Stanford University, 115 Durand Building, Stanford, CA, 94305, USA

    John Gill

Authors
  1. Ke-Chiang Chu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Gill
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Chile, Santiago, Chile

    Ricardo Baeza-Yates

  2. University of Arizona, Tucson, Arizona, USA

    Udi Manber

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer Science+Business Media New York

About this chapter

Cite this chapter

Chu, KC., Gill, J. (1992). Mixed-Radix Huffman Codes. In: Baeza-Yates, R., Manber, U. (eds) Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3422-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-3422-8_19

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6513-6

  • Online ISBN: 978-1-4615-3422-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation