Skip to main content
SpringerLink
Log in

Huffman Coding

  • Living reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

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

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. Cormack GV, Horspool RN (1984) Algorithms for adaptive Huffman codes. Inf Process Lett 18(3):159–165

    Article  MathSciNet  Google Scholar 

  2. Gallager RG (1978) Variations on a theme by Huffman. IEEE Trans Inf Theory IT-24(6):668–674

    Article  MathSciNet  Google Scholar 

  3. Huffman DA (1952) A method for the construction of minimum-redundancy codes. Proc Inst Radio Eng 40(9):1098–1101

    Google Scholar 

  4. Knuth DE (1985) Dynamic Huffman coding. J Algorithms 6(2):163–180

    Article  MATH  MathSciNet  Google Scholar 

  5. Moffat A, Katajainen J (1995) In-place calculation of minimum-redundancy codes. In: Proceedings of the Workshop on Algorithms and Data Structures, Kingston, pp 393–402

    Google Scholar 

  6. Moffat A, Turpin A (1997) On the implementation of minimum-redundancy prefix codes. IEEE Trans Commun 45(10):1200–1207

    Article  Google Scholar 

  7. Stix G (1991) Profile: information theorist David A. Huffman. Sci Am 265(3):54–58. Reproduced at http://www.huffmancoding.com/my-uncle/david-bio. Accessed 15 July 2014

  8. Turpin A, Moffat A (2000) Housekeeping for prefix coding. IEEE Trans Commun 48(4):622–628

    Article  MATH  Google Scholar 

  9. Turpin A, Moffat A (2001) On-line adaptive canonical prefix coding with bounded compression loss. IEEE Trans Inf Theory 47(1):88–98

    Article  MATH  MathSciNet  Google Scholar 

  10. van Leeuwen J (1976) On the construction of Huffman trees. In: Proceedings of the International Conference on Automata, Languages, and Programming, Edinburgh University, Edinburgh, pp 382–410

    Google Scholar 

  11. Vitter JS (1987) Design and analysis of dynamic Huffman codes. J ACM 34(4):825–845

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing and Information Systems, The University of Melbourne, 3010, Melbourne, VIC, Australia

    Alistair Moffat

Authors
  1. Alistair Moffat
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alistair Moffat .

Editor information

Editors and Affiliations

  1. Dept. Electrical Engineering & Computer Science, Northwestern University, Evanston, Illinois, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this entry

Cite this entry

Moffat, A. (2014). Huffman Coding. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-3-642-27848-8_633-1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27848-8_633-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Online ISBN: 978-3-642-27848-8

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation