loading...
An Efficient Implementation of Adaptive Prefix Coding
Snowbird, Utah March 27-March 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2007.122007 Data Compression Conference (DCC ...
 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 
 
Yakov Nekrich, "An Efficient Implementation of Adaptive Prefix Coding," Data Compression Conference, pp. 396, 2007 Data Compression Conference (DCC'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/DCC.2007.12,
author = {Yakov Nekrich},
title = {An Efficient Implementation of Adaptive Prefix Coding},
journal ={Data Compression Conference},
volume = {0},
year = {2007},
issn = {1068-0314},
pages = {396},
doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2007.12},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Compression Conference
TI - An Efficient Implementation of Adaptive Prefix Coding
SN - 1068-0314
SP
EP
A1 - Yakov Nekrich,
PY - 2007
KW - null
VL - 0
JA - Data Compression Conference
ER -
 
Yakov Nekrich, University of Bonn
The goal of the prefix coding is to assign codewords to elements of the input alphabet A, so that no codeword is a prefix of another one, and the total length of the encoded message S is minimized. In the case of static prefix coding, symbol frequencies are known in advance.
Citation:
Yakov Nekrich, "An Efficient Implementation of Adaptive Prefix Coding," dcc, pp.396, 2007 Data Compression Conference (DCC'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.