A (non)static 0-order statistical model and its implementation for compressing virtually uncompressible data
Evgueniy Vitchev

TL;DR
This paper presents a statistical model designed to compress data that appears nearly random, along with its implementation, aiming to improve compression of virtually uncompressible data.
Contribution
It introduces a novel (non)static 0-order statistical model and provides an implementation for compressing nearly random binary sequences.
Findings
Effective compression of near-random binary data.
Implementation demonstrates practical applicability.
Model approaches the limits of compressibility for random-like data.
Abstract
We give an implementation of a statistical model, which can be successfully applied for compressing of a sequence of binary digits with behavior close to random.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Algorithms and Data Compression · Mathematical Dynamics and Fractals
