2000 character limit reached
A New Lossless Data Compression Algorithm Exploiting Positional Redundancy
Published 29 Jul 2021 in cs.DS | (2107.13801v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
