Abstract
This chapter discusses a popular algorithm coding called the “Huffman coding algorithm.” It provides the procedure for building Huffman codes when the probability model for the source is known, then a procedure for building codes when the source statistics are unknown. The chapter also describes few techniques for code design that are in sense similar to Huffman coding approach. David Huffman as part of a class assignment developed the Huffman coding algorithm. Huffman codes are prefix codes and are optimum for a set of probabilities. The Huffman code is based on two observations. First, in an optimum code, symbols that occur more frequently (have a higher probability of occurrence) have shorter codewords than symbols that occur less frequently. Second, in an optimum code, the two symbols that occur least frequently have the same length. The Huffman procedure is obtained by adding a simple requirement to these two observations. This requirement is that the codewords corresponding to the two lowest probability symbols differ only in the last bit.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
