Abstract
Abstract The past 25 years have witnessed widespread applications of Huffman coding. In this article, the theme of Huffman coding is thoroughly discussed. The concepts of uniquely decodable codes and prefix codes are reviewed. The Huffman coding problem is defined. The Huffman coding algorithm, the adaptive Huffman coding algorithm, Golomb codes, and Gallager‐Voorhis codes are described in detail. Their performance is analyzed theoretically. Applications of Huffman coding are also mentioned.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
