Entropy and Average Cost of AUH Codes

In this paper we address the class of anti-uniform Huffman (AUH) codes, also named unary codes, for sources with finite and infinite alphabet, respectively. Geometric, quasi-geometric, Fibonacci and exponential distributions lead to anti-uniform sources for some ranges of their parameters. Huffman coding of these sources results in AUH codes. We prove that, in general, sources with memory are obtained as result of this encoding. For these sources we attach the graph and determine the transition matrix between states, the state probabilities and the entropy. We also compute the average cost for these AUH codes