Prefix code

Huffman Coding Matlab Code

Huffman code is an optimal prefix code found using the algorithm developed by David A. Huffman while he was a Ph.D. student at MIT, and published in the 1952 paper "A Method for the Construction of Minimum-Redundancy Codes". The process of finding and/or using such a code is called Huffman coding and is a common technique in entropy encoding, including in lossless data compression. The algorithm's output can be viewed as a variable-length code table for encoding a source symbol (such as a character in a file).

Huffman encoding in matlab

The following Matlab project contains the source code and Matlab examples used for huffman encoding. The use of Huffman coding functions is simplyfied such that the user needs only to enter the signal to be encoded, and all other details, like the list of symbols and their probabilities, are determuned by the program.
Subscribe to RSS - Prefix code