Generalization of Efficient Implementation of Compression by Substring Enumeration

Shumpei Sakuma; Kazuyuki Narisawa; Ayumi Shinohara

doi:10.1109/DCC.2016.86

Generalization of Efficient Implementation of Compression by Substring Enumeration

Shumpei Sakuma, Kazuyuki Narisawa, Ayumi Shinohara

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

Abstract

Compression via Substring Enumeration (CSE) is a lossless universal data compression scheme, introduced by Dube and Beaudoin [1]. CSE compresses a target binary string by enumerating substrings occurred in it, and encodes the numbers of occurrences effectively, by calculating its upper-bound and lower-bound based on the previous numbers. They used a data structure called Compacted Substring Tree (CST) for counting the occurrences. Instead of CST, Kanai et al. [2] proposed an elegant and efficient implementation for CSE by utilizing Burrows-Wheeler Transform (BWT) Matrix and several auxiliary arrays. In this paper, we extend it in two ways, (1) to deal with the explicit phase awareness for byte-oriented source, and (2) to treat multiple characters for a finite alphabet source.

Original language	English
Title of host publication	Proceedings - DCC 2016
Subtitle of host publication	2016 Data Compression Conference
Editors	Michael W. Marcellin, Ali Bilgin, Joan Serra-Sagrista, James A. Storer
Publisher	Institute of Electrical and Electronics Engineers Inc.
Number of pages	1
ISBN (Electronic)	9781509018536
DOIs	https://doi.org/10.1109/DCC.2016.86
Publication status	Published - 2016 Dec 15
Event	2016 Data Compression Conference, DCC 2016 - Snowbird, United States Duration: 2016 Mar 29 → 2016 Apr 1

Publication series

Name	Data Compression Conference Proceedings
ISSN (Print)	1068-0314

Other

Other	2016 Data Compression Conference, DCC 2016
Country	United States
City	Snowbird
Period	16/3/29 → 16/4/1

ASJC Scopus subject areas

Computer Networks and Communications

Access to Document

10.1109/DCC.2016.86

Fingerprint Dive into the research topics of 'Generalization of Efficient Implementation of Compression by Substring Enumeration'. Together they form a unique fingerprint.

Cite this

Sakuma, S., Narisawa, K., & Shinohara, A. (2016). Generalization of Efficient Implementation of Compression by Substring Enumeration. In M. W. Marcellin, A. Bilgin, J. Serra-Sagrista, & J. A. Storer (Eds.), Proceedings - DCC 2016: 2016 Data Compression Conference [7786254] (Data Compression Conference Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/DCC.2016.86

Generalization of Efficient Implementation of Compression by Substring Enumeration. / Sakuma, Shumpei; Narisawa, Kazuyuki; Shinohara, Ayumi.

Proceedings - DCC 2016: 2016 Data Compression Conference. ed. / Michael W. Marcellin; Ali Bilgin; Joan Serra-Sagrista; James A. Storer. Institute of Electrical and Electronics Engineers Inc., 2016. 7786254 (Data Compression Conference Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Sakuma, S, Narisawa, K & Shinohara, A 2016, Generalization of Efficient Implementation of Compression by Substring Enumeration. in MW Marcellin, A Bilgin, J Serra-Sagrista & JA Storer (eds), Proceedings - DCC 2016: 2016 Data Compression Conference., 7786254, Data Compression Conference Proceedings, Institute of Electrical and Electronics Engineers Inc., 2016 Data Compression Conference, DCC 2016, Snowbird, United States, 16/3/29. https://doi.org/10.1109/DCC.2016.86

Sakuma S, Narisawa K, Shinohara A. Generalization of Efficient Implementation of Compression by Substring Enumeration. In Marcellin MW, Bilgin A, Serra-Sagrista J, Storer JA, editors, Proceedings - DCC 2016: 2016 Data Compression Conference. Institute of Electrical and Electronics Engineers Inc. 2016. 7786254. (Data Compression Conference Proceedings). https://doi.org/10.1109/DCC.2016.86

Sakuma, Shumpei ; Narisawa, Kazuyuki ; Shinohara, Ayumi. / Generalization of Efficient Implementation of Compression by Substring Enumeration. Proceedings - DCC 2016: 2016 Data Compression Conference. editor / Michael W. Marcellin ; Ali Bilgin ; Joan Serra-Sagrista ; James A. Storer. Institute of Electrical and Electronics Engineers Inc., 2016. (Data Compression Conference Proceedings).

@inproceedings{8867b3244c74412a829eefb9f988623b,

title = "Generalization of Efficient Implementation of Compression by Substring Enumeration",

abstract = "Compression via Substring Enumeration (CSE) is a lossless universal data compression scheme, introduced by Dube and Beaudoin [1]. CSE compresses a target binary string by enumerating substrings occurred in it, and encodes the numbers of occurrences effectively, by calculating its upper-bound and lower-bound based on the previous numbers. They used a data structure called Compacted Substring Tree (CST) for counting the occurrences. Instead of CST, Kanai et al. [2] proposed an elegant and efficient implementation for CSE by utilizing Burrows-Wheeler Transform (BWT) Matrix and several auxiliary arrays. In this paper, we extend it in two ways, (1) to deal with the explicit phase awareness for byte-oriented source, and (2) to treat multiple characters for a finite alphabet source.",

author = "Shumpei Sakuma and Kazuyuki Narisawa and Ayumi Shinohara",

year = "2016",

month = dec,

day = "15",

doi = "10.1109/DCC.2016.86",

language = "English",

series = "Data Compression Conference Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

editor = "Marcellin, {Michael W.} and Ali Bilgin and Joan Serra-Sagrista and Storer, {James A.}",

booktitle = "Proceedings - DCC 2016",

note = "2016 Data Compression Conference, DCC 2016 ; Conference date: 29-03-2016 Through 01-04-2016",

}

TY - GEN

T1 - Generalization of Efficient Implementation of Compression by Substring Enumeration

AU - Sakuma, Shumpei

AU - Narisawa, Kazuyuki

AU - Shinohara, Ayumi

PY - 2016/12/15

Y1 - 2016/12/15

N2 - Compression via Substring Enumeration (CSE) is a lossless universal data compression scheme, introduced by Dube and Beaudoin [1]. CSE compresses a target binary string by enumerating substrings occurred in it, and encodes the numbers of occurrences effectively, by calculating its upper-bound and lower-bound based on the previous numbers. They used a data structure called Compacted Substring Tree (CST) for counting the occurrences. Instead of CST, Kanai et al. [2] proposed an elegant and efficient implementation for CSE by utilizing Burrows-Wheeler Transform (BWT) Matrix and several auxiliary arrays. In this paper, we extend it in two ways, (1) to deal with the explicit phase awareness for byte-oriented source, and (2) to treat multiple characters for a finite alphabet source.

AB - Compression via Substring Enumeration (CSE) is a lossless universal data compression scheme, introduced by Dube and Beaudoin [1]. CSE compresses a target binary string by enumerating substrings occurred in it, and encodes the numbers of occurrences effectively, by calculating its upper-bound and lower-bound based on the previous numbers. They used a data structure called Compacted Substring Tree (CST) for counting the occurrences. Instead of CST, Kanai et al. [2] proposed an elegant and efficient implementation for CSE by utilizing Burrows-Wheeler Transform (BWT) Matrix and several auxiliary arrays. In this paper, we extend it in two ways, (1) to deal with the explicit phase awareness for byte-oriented source, and (2) to treat multiple characters for a finite alphabet source.

UR - http://www.scopus.com/inward/record.url?scp=85010042716&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85010042716&partnerID=8YFLogxK

U2 - 10.1109/DCC.2016.86

DO - 10.1109/DCC.2016.86

M3 - Conference contribution

AN - SCOPUS:85010042716

T3 - Data Compression Conference Proceedings

BT - Proceedings - DCC 2016

A2 - Marcellin, Michael W.

A2 - Bilgin, Ali

A2 - Serra-Sagrista, Joan

A2 - Storer, James A.

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 Data Compression Conference, DCC 2016

Y2 - 29 March 2016 through 1 April 2016

ER -