This paper gives an array-based practical encoder for the lossless data compression algorithm known as Compression by Substring Enumeration (CSE). The encoder makes use of the relation between CSE and the Burrows-Wheeler transform. We also modify the decoding algorithm to accommodate to the proposed encoder. Thanks to the proposed encoder and decoder, we can apply CSE to long data of more than tens of megabytes. We show compression results obtained when we perform experiments on such long data. The results empirically validate theoretical predictions on CSE.
Sho KANAI
Gunma University
Hidetoshi YOKOO
Gunma University
Kosumo YAMAZAKI
Gunma University
Hideaki KANEYASU
Gunma University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Sho KANAI, Hidetoshi YOKOO, Kosumo YAMAZAKI, Hideaki KANEYASU, "Efficient Implementation and Empirical Evaluation of Compression by Substring Enumeration" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 2, pp. 601-611, February 2016, doi: 10.1587/transfun.E99.A.601.
Abstract: This paper gives an array-based practical encoder for the lossless data compression algorithm known as Compression by Substring Enumeration (CSE). The encoder makes use of the relation between CSE and the Burrows-Wheeler transform. We also modify the decoding algorithm to accommodate to the proposed encoder. Thanks to the proposed encoder and decoder, we can apply CSE to long data of more than tens of megabytes. We show compression results obtained when we perform experiments on such long data. The results empirically validate theoretical predictions on CSE.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.601/_p
Copy
@ARTICLE{e99-a_2_601,
author={Sho KANAI, Hidetoshi YOKOO, Kosumo YAMAZAKI, Hideaki KANEYASU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Implementation and Empirical Evaluation of Compression by Substring Enumeration},
year={2016},
volume={E99-A},
number={2},
pages={601-611},
abstract={This paper gives an array-based practical encoder for the lossless data compression algorithm known as Compression by Substring Enumeration (CSE). The encoder makes use of the relation between CSE and the Burrows-Wheeler transform. We also modify the decoding algorithm to accommodate to the proposed encoder. Thanks to the proposed encoder and decoder, we can apply CSE to long data of more than tens of megabytes. We show compression results obtained when we perform experiments on such long data. The results empirically validate theoretical predictions on CSE.},
keywords={},
doi={10.1587/transfun.E99.A.601},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Efficient Implementation and Empirical Evaluation of Compression by Substring Enumeration
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 601
EP - 611
AU - Sho KANAI
AU - Hidetoshi YOKOO
AU - Kosumo YAMAZAKI
AU - Hideaki KANEYASU
PY - 2016
DO - 10.1587/transfun.E99.A.601
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2016
AB - This paper gives an array-based practical encoder for the lossless data compression algorithm known as Compression by Substring Enumeration (CSE). The encoder makes use of the relation between CSE and the Burrows-Wheeler transform. We also modify the decoding algorithm to accommodate to the proposed encoder. Thanks to the proposed encoder and decoder, we can apply CSE to long data of more than tens of megabytes. We show compression results obtained when we perform experiments on such long data. The results empirically validate theoretical predictions on CSE.
ER -