On Slepian–Wolf Theorem with Interaction
From MaRDI portal
Publication:5740187
DOI10.1007/978-3-319-34171-2_15zbMath1385.68014MaRDI QIDQ5740187
Publication date: 25 July 2016
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-34171-2_15
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
94A17: Measures of information, entropy
Related Items
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