1. Zvonkin, A.K. and Levin, L.A., Complexity of Finite Objects and the Algorithmic Concepts of Information and Randomness, Uspekhi Mat. Nauk, 1970, vol. 25, no. 6, pp. 85–127 [Russian Math. Surveys (Engl. Transl.), 1970, vol. 25, no. 6, pp. 83–124].
2. Li, M. and Vitányi, P., An Introduction to Kolmogorov Complexity and Its Applications, New York: Springer, 2008, 3rd ed.
3. Muchnik, An.A., Conditional Complexity and Codes, Theoret. Comput. Sci., 2002, vol. 271, no. 1–2, pp. 97–109.
4. Gács, P. and Körner, J., Common Information Is Far Less than Mutual Information, Probl. Control Inform. Theory, 1973, vol. 2, no. 2, pp. 149–162.
5. Lect. Notes Comp. Sci.;R. Ahlswede,2006