This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2011 10th IEEE/ACIS International Conference on Computer and Information Science
An Improvement in Lossless Data Compression via Substring Enumeration
Sanya, Hainan Island China
May 16-May 18
ISBN: 978-0-7695-4401-4
ASCII Text
x 
 
Ken-ichi Iwata, Mitsuharu Arimura, Yuki Shima, "An Improvement in Lossless Data Compression via Substring Enumeration," Computer and Information Science, ACIS International Conference on, pp. 219-223, 2011 10th IEEE/ACIS International Conference on Computer and Information Science, 2011.
 
 
BibTex
x
 
@article{ 10.1109/ICIS.2011.41,
author = {Ken-ichi Iwata and Mitsuharu Arimura and Yuki Shima},
title = {An Improvement in Lossless Data Compression via Substring Enumeration},
journal ={Computer and Information Science, ACIS International Conference on},
volume = {0},
year = {2011},
isbn = {978-0-7695-4401-4},
pages = {219-223},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICIS.2011.41},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer and Information Science, ACIS International Conference on
TI - An Improvement in Lossless Data Compression via Substring Enumeration
SN - 978-0-7695-4401-4
SP219
EP223
A1 - Ken-ichi Iwata,
A1 - Mitsuharu Arimura,
A1 - Yuki Shima,
PY - 2011
KW - Lossless data compression
KW - Compression via substring enumeration
KW - compression ratio
VL - 0
JA - Computer and Information Science, ACIS International Conference on
ER -
 
Dube ´ and Beaudoin proposed a new technique of loss less data compression called compression via sub string enumeration (CSE) in 2010. It has been indicated that the compression ratio of CSE achieves competitive performance for ones of the best PPM variants and BZIP2 from the viewpoint of experimental results. We refine the technique of CSE to reduce the candidate value of range to encode, and make the compression performance of our improvement clear analytically for some input strings, which have zero entropy rate. We show that the performance of compression ratio of the improved CSE never becomes worse than one of the original CSE for any source string in linear-time and linear-space complexity for the length of string.
Index Terms:
Lossless data compression, Compression via substring enumeration, compression ratio
Citation:
Ken-ichi Iwata, Mitsuharu Arimura, Yuki Shima, "An Improvement in Lossless Data Compression via Substring Enumeration," icis, pp.219-223, 2011 10th IEEE/ACIS International Conference on Computer and Information Science, 2011
Usage of this product signifies your acceptance of the Terms of Use.