Open AccessPosted Content
Lossless compression catalyst based on binary allocation via modular arithmetic.
Reads0
Chats0
TLDR
A new binary (bit-level) lossless compression catalyst method based on a modular arithmetic, called Binary Allocation via Modular Arithmetic (BAMA), has been introduced and allows a significant increase in the compression performance of binary sequences, among others.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.read more
Citations
More filters
[서평]「Applied Cryptography」
TL;DR: The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity.
Elements Of Number Theory
TL;DR: The elements of number theory is universally compatible with any devices to read, allowing you to get the most less latency time to download any of the authors' books like this one.
Journal ArticleDOI
Solved and Unsolved Problems in Number Theory.
W. J. LeVeque,Daniel Shanks +1 more
TL;DR: In this article, the authors used solved and unsolved problems in number theory to solve the problem of where to get the ideas for a novel, which can be one of the right sources to develop a writing skill.
References
More filters
Journal ArticleDOI
A universal algorithm for sequential data compression
Jacob Ziv,A. Lempel +1 more
TL;DR: The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable- to-block codes designed to match a completely specified source.
Journal ArticleDOI
A Method for the Construction of Minimum-Redundancy Codes
TL;DR: A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Journal ArticleDOI
A method for the construction of minimum-redundancy codes
TL;DR: A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Book
The Theory of the Riemann Zeta-Function
TL;DR: The Riemann zeta-function embodies both additive and multiplicative structures in a single function, making it one of the most important tools in the study of prime numbers as mentioned in this paper.