A New Lossless Data Compression Algorithm Exploiting Positional Redundancy

TL;DR

This paper introduces a novel lossless data compression algorithm that uses a two-dimensional concentric circle model to detect non-contiguous runs, generalizing run length encoding and comparing its performance with TurboRLE.

Contribution

The paper presents a new 2D visual transform-based run length encoding algorithm exploiting positional redundancy, offering a generalized approach to run detection in lossless data compression.

Findings

Outperforms TurboRLE in certain scenarios

Detects non-contiguous runs effectively

Characterized advantages and drawbacks

Abstract

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.