Let be a Discrete Memoryless Source taking values in . Let be a Decipherable code We say that is optimal if it minimizes the Expected word length Shannon’s noiseless coding theorem Huffman Coding is optimal.