Optimal prefix codes for pairs of geometrically-distributed random variables - GREYC amacc Access content directly
Conference Papers Year : 2006

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.
Fichier principal
Vignette du fichier
hal.pdf (616.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00619869 , version 1 (06-10-2011)

Identifiers

  • HAL Id : hal-00619869 , version 1

Cite

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. ⟨hal-00619869⟩
148 View
227 Download

Share

Gmail Facebook X LinkedIn More