zbMATH — the first resource for mathematics

A criterion for extractability of mutual information for a triple of strings. (English. Russian original) Zbl 1077.94008
Probl. Inf. Transm. 39, No. 1, 148-157 (2003); translation from Prob. Peredachi Inf. 39, No. 1, 166-175 (2003).
The referred paper contributes to the theory of Kolmogorov complexity as a non-Shannon type of information. The basic concepts are the binary string (finite sequence of symbols from a binary alphabet), its Kolmogorov complexity (number of bits in the shortest program generating it), and the conditional information about the strings. The interest is focused on the extrability of the mutual information connected with the independence of two binary strings via a third one. This extrability regarded to triples of strings is the topic of the main results presented in the paper.

94A15 Information theory (general)
94A17 Measures of information, entropy
68Q30 Algorithmic information theory (Kolmogorov complexity, etc.)
Full Text: DOI