The search functionality is under construction.
The search functionality is under construction.

Efficient Implementation and Empirical Evaluation of Compression by Substring Enumeration

Sho KANAI, Hidetoshi YOKOO, Kosumo YAMAZAKI, Hideaki KANEYASU

  • Full Text Views

    0

  • Cite this

Summary :

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.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.2 pp.601-611
Publication Date
2016/02/01
Publicized
Online ISSN
1745-1337
DOI
10.1587/transfun.E99.A.601
Type of Manuscript
PAPER
Category
Information Theory

Authors

Sho KANAI
  Gunma University
Hidetoshi YOKOO
  Gunma University
Kosumo YAMAZAKI
  Gunma University
Hideaki KANEYASU
  Gunma University

Keyword