A criterion for extractability of mutual information for a triple of strings (Q2487083)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A criterion for extractability of mutual information for a triple of strings |
scientific article |
Statements
A criterion for extractability of mutual information for a triple of strings (English)
0 references
17 August 2005
0 references
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.
0 references
information
0 references
mutual information
0 references
binary string
0 references
Kolmogorov complexity
0 references
extraction of mutual information
0 references