Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time

In a lossless compression system with target lengths, a compressor maps an integer m and a binary string x to an m-bit code p, and if m is sufficiently large, a decompressor reconstructs x from p. We call a pair (m,x) achievable for ( , ) if this reconstruction is successful. We introduce the notion of an optimal compressor opt by the following universality property: For any compressor-decompressor pair ( , ), there exists a decompressor ′ such that if (m,x) is achievable for ( , ), then (m + Δ , x) is achievable for ( opt, ′), where Δ is some small value called the overhead. We show that there exists an optimal compressor that has only polylogarithmic overhead and works in probabilistic polynomial time. Differently said, for any pair ( , ), no matter how slow is, or even if is non-computable, opt is a fixed compressor that in polynomial time produces codes almost as short as those of . The cost is that the corresponding decompressor is slower. We also show that each such optimal compressor can be used for distributed compression, in which case it can achieve optimal compression rates as given in the Slepian–Wolf theorem and even for the Kolmogorov complexity variant of this theorem.