A New Lossless Data Compression Algorithm Exploiting Positional Redundancy

Pranav Venkatram · arXiv (Cornell University) · 2021

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 the paper · More papers on PaperTik