M-ary Anti - Uniform Huffman Codes for Infinite Sources With Geometric Distribution - Université de Rennes Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

M-ary Anti - Uniform Huffman Codes for Infinite Sources With Geometric Distribution

Résumé

In this paper we consider the class of generalized antiuniform Huffman (AUH) codes for sources with infinite alphabet and geometric distribution. This distribution leads to infinite anti- uniform sources for some ranges of its parameters. Huffman coding of these sources results in AUH codes. We perform a generalization of binary Huffman encoding, using a M-letter code alphabet and prove that as a result of this encoding, sources with memory are obtained. For these sources we attach the graph and derive the transition probabilities between states, as well as the state probabilities. The entropy and the average cost for AUH codes are derived.
Fichier principal
Vignette du fichier
ISSCS2013_M-ary_Anti_-_Uniform_Huffman_Codes_for_Infinite_Sources_With_Geometric_Distribution_DT.pdf (76.93 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00873922 , version 1 (16-10-2013)

Identifiants

  • HAL Id : hal-00873922 , version 1

Citer

Daniela Tarniceriu, Valeriu Munteanu, Gheorghe Zaharia. M-ary Anti - Uniform Huffman Codes for Infinite Sources With Geometric Distribution. International Symposium on Signals, Circuits and Systems, Jul 2013, Iasi, Romania. pp.1-4. ⟨hal-00873922⟩
112 Consultations
458 Téléchargements

Partager

Gmail Facebook X LinkedIn More