loading...
Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions
Snowbird, Utah March 28-March 30
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2006.64Data Compression Conference (DCC'06)
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Frederique Bassino, Universite de Marne-la-Vallee, France
Julien Clement, Universite de Caen, France.
Gadiel Seroussi, Mathematical Sciences Research Institute
Alfredo Viola, Universidad de la Republica, Uruguay
Lossless compression is studied for pairs of independent integer-valued symbols emitted by a source with a geometric probability distribution of parameter q ∊? (0, 1). Optimal prefix codes are described for q = 1/2k (k > 1) and q = 1/ k√?2 (k > 0). 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.
Citation:
Frederique Bassino, Julien Clement, Gadiel Seroussi, Alfredo Viola, "Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions," dcc, pp.113-122, Data Compression Conference (DCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.