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


Shen, Alexander

Multisource Algorithmic Information Theory

pdf-format:
06051.ShenAlexander.ExtAbstract.626.pdf (0.2 MB)


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:DagSemProc.06051.9,
  author =	{Shen, Alexander},
  title =	{{Multisource Algorithmic Information Theory}},
  booktitle =	{Kolmogorov Complexity and Applications},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6051},
  editor =	{Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2006/626},
  URN =		{urn:nbn:de:0030-drops-6267},
  doi =		{10.4230/DagSemProc.06051.9},
  annote =	{Keywords: Kolmogorov complexity multisource information theory}
}

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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI