Huffman coding

• Given X = {a1, a2, …aK}, with associated probabilities P(ak)

• Given a code with codeword lengths n1, n2, …nk

  • The expected code length

• No instantaneous, UD code can achieve a smaller than a Huffman code

Previous slide

Next slide

Back to first slide

View graphic version