We want a way of generating a Prefix-Free code for any Source Coding problem. Huffman Coding See Huffman Coding Diadic Source Diadic Source is an information source for which the probability of occurrence for each symbol is a member of \frac{1}{2^{n}} for integer n. That is, the probability of each symbol is in powers of \frac{1}{2}. In THESE sources, Huffman Coding will always result in a code that communicates the information in the same number of bits as the entropy of the source.