Error-Free Compression:Huffman Coding Huffman coding:give the smallest possible number of code symbols per source symbols. Step 1:Source reduction Original source Source reduction Symbol Probability 1 2 3 4 a 0.4 0.4 0.4 0.40.6 as 0.3 0.3 0.3 0.3 0.4 a 0.1 0.10.2 T0.3 4 0.1 0.1 0.1 as 0.06 0.1 as 0.04 Error-Free Compression: Huffman Coding Step 1: Source reduction Huffman coding: give the smallest possible number of code symbols per source symbols