License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-6267
URL: http://drops.dagstuhl.de/opus/volltexte/2006/626/
Go to the corresponding Portal


Shen, Alexander

Multisource Algorithmic Information Theory

pdf-format:
Document 1.pdf (163 KB)


Abstract

Multisource information theory is well known in Shannon setting. It studies the possibilities of information transfer through a network with limited capacities. Similar questions could be studied for algorithmic information theory and provide a framework for several known results and interesting questions.

BibTeX - Entry

@InProceedings{shen:DSP:2006:626,
  author =	{Alexander Shen},
  title =	{Multisource Algorithmic Information Theory},
  booktitle =	{Kolmogorov Complexity and Applications},
  year =	{2006},
  editor =	{Marcus Hutter  and Wolfgang Merkle and Paul M.B. Vitanyi},
  number =	{06051},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/626},
  annote =	{Keywords: Kolmogorov complexity multisource information theory}
}

Keywords: Kolmogorov complexity multisource information theory
Seminar: 06051 - Kolmogorov Complexity and Applications
Issue Date: 2006
Date of publication: 31.07.2006


DROPS-Home | Fulltext Search | Imprint Published by LZI