pith. sign in

arxiv: 1405.0933 · v2 · pith:6VU7QY4Lnew · submitted 2014-05-05 · 💻 cs.IT · math.IT

Lossless compression catalyst based on binary allocation via modular arithmetic

classification 💻 cs.IT math.IT
keywords binarycompressionarithmeticcatalystlosslessmodularallocationbama
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.