First page Back Continue Last page Overview Graphics

# Huffman Encoding

- ## Based on probability (frequency) of symbols

- ## Assign codewords as bits

- ## Builds a binary tree based on probability

- Frequent / high probability symbols at the top
- Infrequent / low probability symbols lower down
- Branches labelled with 0 and 1

- ## Frequent symbols get short bit strings

- ## Infrequent symbols get longer bit strings