Huffman coding

Topic | v1 | created by janarez |

In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. The process of finding or using such a code proceeds by means of Huffman coding, an algorithm developed by David A. Huffman while he was a Sc.D. student at MIT, and published in the 1952 paper "A Method for the Construction of Minimum-Redundancy Codes". The output from Huffman's algorithm can be viewed as a variable-length code table for encoding a source symbol (such as a character in a file). The algorithm derives this table from the estimated probability or frequency of occurrence (weight) for each possible value of the source symbol. As in other entropy encoding methods, more common symbols are generally represented using fewer bits than less common symbols.


subtopic of Data compression

In signal processing, data compression, source coding, or bit-rate reduction is the process of encodi...

Edit details Edit relations Attach new author Attach new topic Attach new resource

treated in Huffman Coding

7.0 rating 2.0 level 9.0 clarity 3.0 background – 1 rating

The description is mainly taken from Professor Vijay Raghunathan. In this assignment, you will utiliz...

treated in Huffman Coding

This chapter describes the details of Huffman encoding and decoding and covers related topics such as...