DeepAI AI Chat
Log In Sign Up

On Undetected Redundancy in the Burrows-Wheeler Transform

by   Uwe Baier, et al.

The Burrows-Wheeler-Transform (BWT) is an invertible permutation of a text known to be highly compressible but also useful for sequence analysis, what makes the BWT highly attractive for lossless data compression. In this paper, we present a new technique to reduce the size of a BWT using its combinatorial properties, while keeping it invertible. The technique can be applied to any BWT-based compressor, and, as experiments show, is able to reduce the encoding size by 8-16 BWT-compressor used), making BWT-based compressors competitive or even superior to today's best lossless compressors.


page 1

page 2

page 3

page 4


k-Modulus Method for Image Transformation

In this paper, we propose a new algorithm to make a novel spatial image ...

A New Lossless Data Compression Algorithm Exploiting Positional Redundancy

A new run length encoding algorithm for lossless data compression that e...

Partition Tree Weighting

This paper introduces the Partition Tree Weighting technique, an efficie...

Resolution of the Burrows-Wheeler Transform Conjecture

Burrows-Wheeler Transform (BWT) is an invertible text transformation tha...

LeCo: Lightweight Compression via Learning Serial Correlations

Lightweight data compression is a key technique that allows column store...

Fast nonlinear embeddings via structured matrices

We present a new paradigm for speeding up randomized computations of sev...

Code Repositories