Interactive channel capacity
From MaRDI portal
Publication:5495842
DOI10.1145/2488608.2488699zbMath1293.94047OpenAlexW2126420649MaRDI QIDQ5495842
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2488608.2488699
Analysis of algorithms and problem complexity (68Q25) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)
Related Items (15)
Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions ⋮ Communication and information complexity ⋮ List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise ⋮ Making Asynchronous Distributed Computations Robust to Channel Noise ⋮ Making asynchronous distributed computations robust to noise ⋮ Reliable communication over highly connected noisy networks ⋮ Unnamed Item ⋮ Capacity of Interactive Communication over Erasure Channels and Channels with Feedback ⋮ Time-space lower bounds for two-pass learning ⋮ Prediction from partial information and hindsight, with application to circuit lower bounds ⋮ Palette-alternating tree codes ⋮ Noisy Interactive Quantum Communication ⋮ Toward better depth lower bounds: two results on the multiplexor relation ⋮ Fast Interactive Coding against Adversarial Noise ⋮ Unnamed Item
This page was built for publication: Interactive channel capacity
