Name
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/DCC.2016.86 | 2016 DATA COMPRESSION CONFERENCE (DCC) |
Field | DocType | ISSN |
Discrete mathematics,Data structure,Compression (physics),Substring,Computer science,Matrix (mathematics),Enumeration,Algorithm,Theoretical computer science,Data compression,Alphabet,Lossless compression | Conference | 1068-0314 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shumpei Sakuma | 1 | 0 | 0.34 |
| Kazuyuki Narisawa | 2 | 33 | 6.82 |
| Ayumi Shinohara | 3 | 936 | 88.28 |