Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called prefix-free codes , that is, the bit string representing some particular symbol is never a prefix of the bit str