INFINITE ANTI - UNIFORM SOURCES WITH GEOMETRIC DISTRIBUTION

Daniela Tarniceriu (1) , Valeriu Munteanu (1) , Gheorghe Zaharia (2)

1 Faculté d'Electronique, Télécommunications et de la Technologie de l'Information
2 IETR - Institut d'Électronique et des Technologies du numéRique

In 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.

Mots clés: Huffman coding; average codeword length; entropy

Domaines: Electronique

Daniela Tarniceriu, Valeriu Munteanu, Gheorghe Zaharia. INFINITE ANTI - UNIFORM SOURCES WITH GEOMETRIC DISTRIBUTION. Bulletin of I.P.I., 2012, 58 (3), pp.35-45. ⟨10.1016/b.ipi.2012.09.012⟩. ⟨hal-00730893⟩