Huffman Coding

Posted on November 8, 2004. Filed under: Computer Science |

In computer science and information theory, Huffman coding is an entropy encoding algorithm used for lossless data compression. The term refers to the use of a variable-length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol. It was 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”.

Lossless Compression Algorithms (Entropy Encoding)

Huffman Coding: A CS2 Assignment

The Huffman Compression Algorithm

Dynamic Huffman Coder
Canonical Huffman Coder Construction
C Library to search over compressed texts
Michael Dipperstein’s Huffman Code Page
libhuffman – Huffman encoder/decoder library
Compression and Encryption Sources
Huffman Coding Class

Adaptive Huffman coding modifies the table as characters are encoded, which allows the encoder to adapt to changing conditions in the input data. Adaptive decoders don’t need a copy of the table when decoding, they start with a fixed decoding table and update the table as characters are read in.

Design and Analysis of Dynamic Huffman Codes
Adaptive Huffman Encoding

Make a Comment

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

Liked it here?
Why not try sites on the blogroll...

%d bloggers like this: