In the literature I have found the unequal letter cost encoding problem where the cost of letters are considered as unequal. Huffman coding with unequal letter cost is one such encoding technique where costs of letters are considered unequal during compressing a message. Now, I would like to know, is there any real life application where the costs of binary bits 0 and 1 are really unequal.