loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (dcc 2008)
Guaranteed Synchronization of Huffman Codes
March 25-March 27
ISBN: 978-0-7695-3121-2
ASCII Text
x 
 
Marek Tomasz Biskup, "Guaranteed Synchronization of Huffman Codes," Data Compression Conference, pp. 462-471, Data Compression Conference (dcc 2008), 2008.
 
 
BibTex
x
 
@article{ 10.1109/DCC.2008.23,
author = {Marek Tomasz Biskup},
title = {Guaranteed Synchronization of Huffman Codes},
journal ={Data Compression Conference},
volume = {0},
year = {2008},
issn = {1068-0314},
pages = {462-471},
doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2008.23},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Compression Conference
TI - Guaranteed Synchronization of Huffman Codes
SN - 1068-0314
SP462
EP471
A1 - Marek Tomasz Biskup,
PY - 2008
KW - Huffman Code
KW - synchronization
KW - synchronization delay
KW - error resilience
VL - 0
JA - Data Compression Conference
ER -
 
In a text encoded with a Huffman code a bit error can propagate arbitrarily long. This paper introduces a method for limiting such error propagation to no more than L bits, L being a parameter of the algorithm. The method utilizes the inherent tendency of the codes to synchronize spontaneously and does not introduce any redundancy if such a synchronization takes place.
Index Terms:
Huffman Code, synchronization, synchronization delay, error resilience
Citation:
Marek Tomasz Biskup, "Guaranteed Synchronization of Huffman Codes," dcc, pp.462-471, Data Compression Conference (dcc 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.