Interactive channel capacity

DOI10.1145/2488608.2488699MaRDI QIDQ5495842zbMATH OpenOpenAlexFDO

Authors Gillat Kol, Ran Raz

Publication date 7 August 2014

Published in Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2488608.2488699

zbMATH Keywords

information theoryentropy functioncommunication complexityinteractive channel capacity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication theory (94A05) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Capacity of interactive communication over erasure channels and channels with feedback
• Capacity of interactive communication over erasure channels and channels with feedback
• Coding for interactive communication
• scientific article; zbMATH DE number 1256711
• Bridging the capacity gap between interactive and one-way communication

Cited in

(22)

• Palette-alternating tree codes
• Time-space lower bounds for two-pass learning
• scientific article; zbMATH DE number 7564410 (Why is no real title available?)
• Fast interactive coding against adversarial noise
• The entropy of lies: playing twenty questions with a liar
• Capacity of interactive communication over erasure channels and channels with feedback
• Making asynchronous distributed computations robust to noise
• Reliable communication over highly connected noisy networks
• Capacity approaching coding for low noise interactive quantum communication
• Synchronization strings: channel simulations and interactive coding for insertions and deletions
• Prediction from partial information and hindsight, with application to circuit lower bounds
• Simulating noisy channel interaction (extended abstract)
• Progress Towards Achieving Channel Capacity
• Noisy interactive quantum communication
• Capacity of interactive communication over erasure channels and channels with feedback
• Communication and information complexity
• Toward better depth lower bounds: two results on the multiplexor relation
• List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
• The rate of interactive codes is bounded away from 1
• scientific article; zbMATH DE number 6866311 (Why is no real title available?)
• Interactive coding with unbounded noise
• Making Asynchronous Distributed Computations Robust to Channel Noise

This page was built for publication: Interactive channel capacity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495842)