Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Julien Clément Connect in order to contact the contributor
Submitted on : Thursday, October 6, 2011 - 1:50:28 PM
Last modification on : Thursday, September 29, 2022 - 2:21:15 PM
Long-term archiving on: : Saturday, January 7, 2012 - 2:22:06 AM


Files produced by the author(s)


  • HAL Id : hal-00619869, version 1


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⟩



Record views


Files downloads