The rate of interactive codes is bounded away from 1
From MaRDI portal
Publication:6499313
DOI10.1145/3564246.3585249MaRDI QIDQ6499313FDOQ6499313
Gillat Kol, Raghuvansh R. Saxena, Klim Efremenko, Dmitry Paramonov
Publication date: 8 May 2024
Cites Work
- A Mathematical Theory of Communication
- Rounds in Communication Complexity Revisited
- Towards coding for maximum errors in interactive communication
- Interactive channel capacity
- Deterministic coding for interactive communication
- Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions
- Title not available (Why is that?)
- Towards Optimal Deterministic Coding for Interactive Communication
- Coding for Interactive Communication: A Survey
- Capacity of Interactive Communication over Erasure Channels and Channels with Feedback
- A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels
- Bridging the Capacity Gap Between Interactive and One-Way Communication
- Title not available (Why is that?)
This page was built for publication: The rate of interactive codes is bounded away from 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499313)
