TL;DR
This paper presents a new coding method that compresses infinite data streams into algorithmically random streams, allowing recovery of initial segments based on their information content, thus extending Shannon's source coding theorem to algorithmic information theory.
Contribution
The paper introduces a novel uniform coding technique for infinite streams that links their initial segments to algorithmically random streams using computable information measures.
Findings
Streams can be encoded into random streams with recoverability based on information content
Recovery bounds depend on computable upper bounds of prefix-free complexity
The method extends Shannon's source coding theorem to infinite sequences
Abstract
According to Kolmogorov complexity, every finite binary string is compressible to a shortest code -- its information content -- from which it is effectively recoverable. We investigate the extent to which this holds for infinite binary sequences (streams). We devise a new coding method which uniformly codes every stream into an algorithmically random stream , in such a way that the first bits of are recoverable from the first bits of , where is any partial computable information content measure which is defined on all prefixes of , and where is the initial segment of of length . As a consequence, if is any computable upper bound on the initial segment prefix-free complexity of , then is computable from an algorithmically random with oracle-use at most . Alternatively (making no use of such a…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
