A New Lossless Data Compression Algorithm Exploiting Positional Redundancy

07/29/2021
by   Pranav Venkatram, et al.
0

A new run length encoding algorithm for lossless data compression that exploits positional redundancy by representing data in a two-dimensional model of concentric circles is presented. This visual transform enables detection of runs (each of a different character) in which runs need not be contiguous and hence, is a generalization of run length encoding. Its advantages and drawbacks are characterized by comparing its performance with TurboRLE.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/13/2021

Improving Run Length Encoding by Preprocessing

The Run Length Encoding (RLE) compression method is a long standing simp...
research
08/31/2022

Computing all-vs-all MEMs in run-length encoded collections of HiFi reads

We describe an algorithm to find maximal exact matches (MEMs) among HiFi...
research
04/05/2018

On Undetected Redundancy in the Burrows-Wheeler Transform

The Burrows-Wheeler-Transform (BWT) is an invertible permutation of a te...
research
09/19/2018

Tail redundancy and its characterization of compression of memoryless sources

We obtain a single-letter characterization that is both necessary and su...
research
06/27/2023

LeCo: Lightweight Compression via Learning Serial Correlations

Lightweight data compression is a key technique that allows column store...
research
08/12/2018

Local Decodability of the Burrows-Wheeler Transform

The Burrows-Wheeler Transform (BWT) is among the most influential discov...
research
09/12/2019

Repeat-Free Codes

In this paper we consider the problem of encoding data into repeat-free ...

Please sign up or login with your details

Forgot password? Click here to reset