vix.ing · top · new · best · stats

Lossless compression catalyst based on binary allocation via modular arithmetic

2014/05/05 by Mario Mastriani, Mastriani, Mario
Computer Science · Mathematics · #Advanced Data Storage Technologies #Algorithms and Data Compression #Cellular Automata and Applications #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1405.0933

19 pages, 16 Figures, 2 Tables

openalex publication_date 2014/05/05 · arxiv created 2014/08/15 · arxiv updated 2014/08/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A new binary (bit-level) lossless compression catalyst method based on a modular arithmetic, called Binary Allocation via Modular Arithmetic (BAMA), has been introduced in this paper. In other words, BAMA is for storage and transmission of binary sequences, digital signal, images and video, also streaming and all kinds of digital transmission. As we said, our method does not compress, but facilitates the action of the real compressor, in our case, any lossless compression algorithm (Run Length Encoding, Lempel-Ziv-Welch, Huffman, Arithmetic, etc), that is, it acts as a compression catalyst. Finally, this catalyst allows a significant increase in the compression performance of binary sequences, among others.

Related