Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Kolmogorov complexity version of Slepian-Wolf coding

From MaRDI portal
Publication:4977957
Jump to:navigation, search

DOI10.1145/3055399.3055421zbMath1370.68147arXiv1511.03602OpenAlexW2962857961MaRDI QIDQ4977957

Marius Zimand

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.03602


zbMATH Keywords

Kolmogorov complexityextractorSlepian-Wolf theoremdistributed compression


Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)


Related Items (1)

An operational characterization of mutual information in algorithmic information theory







This page was built for publication: Kolmogorov complexity version of Slepian-Wolf coding

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4977957&oldid=19425880"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 09:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki