Novel and Generalized Sort-Based Transform for Lossless Data Compression

Authors:
Kazumasa Inagaki;Yoshihiro Tomizawa;Hidetoshi Yokoo
Affiliations:
Department of Computer Science, Gunma University, Kiryu, Japan 376-8515;Department of Computer Science, Gunma University, Kiryu, Japan 376-8515;Department of Computer Science, Gunma University, Kiryu, Japan 376-8515
Venue:
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Year:
2009

Citing 5
Cited 2

A locally adaptive data compression scheme

Communications of the ACM
A Fast Block-Sorting Algorithm for Lossless Data Compression

DCC '97 Proceedings of the Conference on Data Compression
RadixZip: linear time compression of token streams

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching

The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching
Computing Inverse ST in Linear Complexity

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching

Extension and faster implementation of the GRP transform for lossless compression

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Revisiting bounded context block-sorting transformations

Software—Practice & Experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new sort-based transform for lossless data compression that can replace the BWT transform in the block-sorting data compression algorithm. The proposed transform is a parametric generalization of the BWT and the RadixZip transform proposed by Vo and Manku (VLDB, 2008), which is a rather new variation of the BWT. For a class of parameters, the transform can be performed in time linear in the data length. We give an asymptotic compression bound attained by our algorithm.