INFINITE ANTI - UNIFORM SOURCES WITH GEOMETRIC DISTRIBUTION

11 pagesInternational audienceIn this paper we consider the class of anti-uniform Huffman (AUH) codes for sources with infinite alphabet generated by geometric distribution. Huffman encoding of these sources results in AUH codes. As a result of this encoding, we obtain sources with memory. The entropy and average cost of these sources with memory are derived. We perform an analogy between sources with memory and discrete memoryless channels, showing that the entropy of the source with memory is similar to the mean error of the discrete memoryless channel. The information quantity I(X,S) specifies for AUH codes whether they are with memory or not, as it differs from zero or is equal to zero, respectively

Infinite anti-uniform sources

6 pagesInternational audienceIn this paper we consider the class of anti-uniform Huffman (AUH) codes for sources with infinite alphabet. Poisson, negative binomial, geometric and exponential distributions lead to infinite anti-uniform sources for some ranges of their parameters. Huffman coding of these sources results in AUH codes. We prove that as a result of this encoding, we obtain sources with memory. For these sources we attach the graph and derive the transition matrix between states, the state probabilities and the entropy. If c0 and c1 denote the costs for storing or transmission of symbols "0" and "1", respectively, we compute the average cost for these AUH codes