We give simplify the proofs of the 2 results in Marius Zimand's paper "Kolmogorov complexity version of Slepian-Wolf coding, proceedings of STOC 2017, p22--32". The first is a universal polynomial time compression algorithm: on input $\varepsilon > 0$, a number $k$ and a string $x$ it computes in polynomial time with probability $1-\varepsilon$ a program that outputs $x$ and has length $k + O(\log^2 (|x|/\varepsilon))$, provided that there exists such a program of length at most $k$. The second result, is a distributed compression algorithm, in which several parties each send some string to a common receiver. Marius Zimand proved a variant of the Slepian-Wolf theorem using Kolmogorov complexity (in stead of Shannon entropy).
With our simpler proof we improve the parameters of Zimand's result.
[1]
Bruno Bauwens,et al.
Linear List-Approximation for Short Programs (or the Power of a Few Random Bits)
,
2013,
2014 IEEE 29th Conference on Computational Complexity (CCC).
[2]
Nikolai K. Vereshchagin,et al.
Kolmogorov Complexity and Algorithmic Randomness
,
2017
.
[3]
Jason Teutsch,et al.
Short lists for shortest descriptions in short time
,
2012,
computational complexity.
[4]
Marius Zimand.
Kolmogorov complexity version of Slepian-Wolf coding
,
2017,
STOC.
[5]
Nikolai K. Vereshchagin,et al.
Short lists with short programs in short time
,
2013,
2013 IEEE Conference on Computational Complexity.
[6]
Ming Li,et al.
An Introduction to Kolmogorov Complexity and Its Applications
,
1997,
Texts in Computer Science.