Image Coding

Reversible (Information-Preserving, Lossless) Coding

Huffman Coding

• The intuitive idea in Huffman coding is to use variable-length code words, and assign shorter code words to the more probable messages and longer code words to the less likely messages to obtain a code with low average length.

• The Huffman coding procedure guarantees a uniquely decodable code with the minimum average number of bits per message with H ? R ? H + 1.

Difficulties:

• Variable code word length.

• New code mapping required if source probabilities change.

Previous slide

Next slide

Back to first slide

View graphic version