The rate of interactive codes is bounded away from 1
From MaRDI portal
Publication:6499313
DOI10.1145/3564246.3585249MaRDI QIDQ6499313FDOQ6499313
Authors: Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena 
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)
