Optimal prefix codes for pairs of geometrically-distributed random variables

Abstract : Lossless compression is studied for pairs of independent, integer-valued symbols emitted by a source with a geometric probability distribution of parameter q, 0 < q < 1. Optimal prefix codes are described for q = 1/2 k (k > 1) and q = 1/ √k 2 (k > 0). These codes retain some of the low-complexity and low-latency advantage of symbol by symbol coding of geometric distributions, which is widely used in practice, while improving on the inherent redundancy of the approach. From a combinatorial standpoint, the codes described differ from previously characterized cases related to the geometric distribution in that their corresponding trees are of unbounded width, and in that an infinite set of distinct optimal codes is required to cover any interval (0, ε), ε > 0, of values of q.
Type de document :
Communication dans un congrès
IEEE International Symposium on Information Theory (ISIT'06), 2006, United States. pp.2667 - 2671, 2006
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal-upec-upem.archives-ouvertes.fr/hal-00619869
Contributeur : Julien Clément <>
Soumis le : jeudi 6 octobre 2011 - 13:50:28
Dernière modification le : vendredi 22 février 2019 - 11:16:43
Document(s) archivé(s) le : samedi 7 janvier 2012 - 02:22:06

Fichier

hal.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00619869, version 1

Citation

Frédérique Bassino, Julien Clément, Gadiel Seroussi, Alfredo Viola. Optimal prefix codes for pairs of geometrically-distributed random variables. IEEE International Symposium on Information Theory (ISIT'06), 2006, United States. pp.2667 - 2671, 2006. 〈hal-00619869〉

Partager

Métriques

Consultations de la notice

298

Téléchargements de fichiers

68