Affiliation:
1. The University of Melbourne, Melbourne, Victoria, Australia
Abstract
Huffman’s algorithm for computing minimum-redundancy prefix-free codes has almost legendary status in the computing disciplines. Its elegant blend of simplicity and applicability has made it a favorite example in algorithms courses, and as a result it is perhaps one of the most commonly implemented algorithmic techniques. This article presents a tutorial on Huffman coding and surveys some of the developments that have flowed as a consequence of Huffman’s original discovery, including details of code calculation and of encoding and decoding operations. We also survey related mechanisms, covering both arithmetic coding and the recently developed asymmetric numeral systems approach and briefly discuss other Huffman-coding variants, including length-limited codes.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference86 articles.
1. Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes
2. A. A. Belal and A. Elmasry. 2016. Optimal prefix codes with fewer distinct codeword lengths are faster to construct. Retrieved from: CoRR abs/cs/0509015 (2016) 23. A. A. Belal and A. Elmasry. 2016. Optimal prefix codes with fewer distinct codeword lengths are faster to construct. Retrieved from: CoRR abs/cs/0509015 (2016) 23.
3. T. C. Bell J. G. Cleary and I. H. Witten. 1990. Text Compression. Prentice-Hall Englewood Cliffs NJ. T. C. Bell J. G. Cleary and I. H. Witten. 1990. Text Compression. Prentice-Hall Englewood Cliffs NJ.
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献