Efficient Implementation and Empirical Evaluation of Compression by Substring Enumeration
-
- KANAI Sho
- Graduate School of Science and Technology, Gunma University
-
- YOKOO Hidetoshi
- Graduate School of Science and Technology, Gunma University
-
- YAMAZAKI Kosumo
- Graduate School of Science and Technology, Gunma University
-
- KANEYASU Hideaki
- Graduate School of Science and Technology, Gunma University
Description
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.
Journal
-
- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
-
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99.A (2), 601-611, 2016
The Institute of Electronics, Information and Communication Engineers
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1390282681287732992
-
- NII Article ID
- 130005121512
-
- ISSN
- 17451337
- 09168508
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- Crossref
- CiNii Articles
- KAKEN
- OpenAIRE
-
- Abstract License Flag
- Disallowed