|
|
|
|
References
|
|
| |
| 1. |
Gács P., Körner J., “Common Information is Far Less then Mutual Information”, Probl. Control and Inform. Theory, 2:2 (1973), 149–162   |
| 2. |
Muchnik An. A., “On Common Information”, Theoret. Computer Science, 207 (1998), 319–328  |
| 3. |
Romaschenko A. E., “Pary slov s nematerializuemoi vzaimnoi informatsiei”, Probl. peredachi inform., 36:1 (2000), 3–20  |
| 4. |
Chernov A., Muchnik An. A., Shen A., Romashchenko A., Vereshchagin N. K., “Upper Semilattice of Binary Strings with the Relation $x$ is Simple Conditional to $y$”, Theoretical Computer Science, 271 (2002), 69–95 |
| 5. |
Makarychev K., Makarychev Yu., Romashchenko A., Vereshchagin N., “A New Class of Non-Shannon Type Inequalities for Entropies”, Commun. Inform. and Systems, 2:2 (2002), 147–162 |
| 6. |
Zhang Z., Yeung R. W., “On Characterization of Entropy Function via Information Inequalities”, IEEE Trans. Inform. Theory, 44:4 (1998), 1440–1452 |
| 7. |
Kolmogorov A. N., “Tri podkhoda k opredeleniyu ponyatiya “kolichestvo informatsii””, Probl. peredachi inform., 1:1 (1965), 3–11 |
| 8. |
Zvonkin A. K., Levin L. A., “Slozhnost konechnykh ob'ektov i obosnovanie ponyatii informatsii i sluchainosti s pomoschyu teorii algoritmov”, UMN, 25:6 (1970), 85–127 |
| 9. |
Hammer D., Romashchenko A., Shen A., Vereshchagin N., “Inequalities for Shannon entropy and Kolmogorov complexity”, J. Computer and System Sciences, 60 (2000), 442–464 |
