loading...
Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs
Snowbird, Utah March 28-March 30
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2006.36Data Compression Conference (DCC'06)
 This Article 
 
PURCHASE ARTICLE: $0
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Sorina Dumitrescu, "Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs," Data Compression Conference, pp. 444, Data Compression Conference (DCC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/DCC.2006.36,
author = {Sorina Dumitrescu},
title = {Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs},
journal ={Data Compression Conference},
volume = {0},
year = {2006},
issn = {1068-0314},
pages = {444},
doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2006.36},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Compression Conference
TI - Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs
SN - 1068-0314
SP
EP
A1 - Sorina Dumitrescu,
PY - 2006
KW - null
VL - 0
JA - Data Compression Conference
ER -
 
Sorina Dumitrescu, McMaster University, Canada
Let the source alphabet be A = {a_1, a_2, ? ? ? , a_n}, each source symbol a_i having probability p_i \ge 0,\Sigma _{i = 1}^n pi = 1. Let the encoding alphabet be \Sigma = {\alpha1 ,\alpha2, ? ? ? , \alpha_r}, where each letter a_i has an integer cost c_i, such that 0 \le c_1 \le c_2 \le?? ? \le c_r = C, and the greatest common divisor of all costs is 1.
Citation:
Sorina Dumitrescu, "Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs," dcc, pp.444, Data Compression Conference (DCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.