On Slepian-Wolf theorem with interaction

DOI10.1007/s00224-016-9741-xzbMath1394.68136arXiv1506.00617OpenAlexW2568827018MaRDI QIDQ1635810

Alexander Kozachinskiy

Publication date: 1 June 2018

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

information complexitycommunication complexitySlepian-Wolf theoreminteractive compression

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Measures of information, entropy (94A17)

Cites Work

• Unnamed Item
• Towards a reverse Newman's theorem in interactive information complexity
• Private vs. common random bits in communication complexity
• Average-case interactive communication
• Communication Complexity
• Public vs Private Coin in Bounded-Round Information
• Internal Compression of Protocols to Entropy
• Information Equals Amortized Communication
• Noiseless coding of correlated information sources

This page was built for publication: On Slepian-Wolf theorem with interaction