License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1812
URN: urn:nbn:de:0030-drops-18128
URL: http://drops.dagstuhl.de/opus/volltexte/2009/1812/
 Go to the corresponding LIPIcs Volume Portal

### Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence

 pdf-format:

### Abstract

An infinite binary sequence has randomness rate at least $\sigma$ if, for almost every $n$, the Kolmogorov complexity of its prefix of length $n$ is at least $\sigma n$. It is known that for every rational $\sigma \in (0,1)$, on one hand, there exists sequences with randomness rate $\sigma$ that can not be effectively transformed into a sequence with randomness rate higher than $\sigma$ and, on the other hand, any two independent sequences with randomness rate $\sigma$ can be transformed into a sequence with randomness rate higher than $\sigma$. We show that the latter result holds even if the two input sequences have linear dependency (which, informally speaking, means that all prefixes of length $n$ of the two sequences have in common a constant fraction of their information). The similar problem is studied for finite strings. It is shown that from any two strings with sufficiently large Kolmogorov complexity and sufficiently small dependence, one can effectively construct a string that is random even conditioned by any one of the input strings.

### BibTeX - Entry

@InProceedings{zimand:LIPIcs:2009:1812,
author =	{Marius Zimand},
title =	{{Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence}},
booktitle =	{26th International Symposium on Theoretical Aspects of Computer Science},
pages =	{697--708},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-939897-09-5},
ISSN =	{1868-8969},
year =	{2009},
volume =	{3},
editor =	{Susanne Albers and Jean-Yves Marion},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address =	{Dagstuhl, Germany},
URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/1812},
URN =		{urn:nbn:de:0030-drops-18128},
doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2009.1812},
annote =	{Keywords: Algorithmic information theory, Computational complexity, Kolmogorov complexity, Randomness extractors}
}


 Keywords: Algorithmic information theory, Computational complexity, Kolmogorov complexity, Randomness extractors Seminar: 26th International Symposium on Theoretical Aspects of Computer Science Issue Date: 2009 Date of publication: 19.02.2009

DROPS-Home | Fulltext Search | Imprint