2021/07/29 by Pranav Venkatram, Venkatram, Pranav
Computer Science · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.DS
paper · pdf · doi:10.48550/arxiv.2107.13801
arxiv created 2021/07/29 · arxiv updated 2021/07/30
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.