The rate of interactive codes is bounded away from 1

DOI10.1145/3564246.3585249MaRDI QIDQ6499313

Gillat Kol, Raghuvansh R. Saxena, Klim Efremenko, Dmitry Paramonov

Publication date: 8 May 2024

zbMATH Keywords

communication complexityerror correcting codesinteractive coding

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Rounds in Communication Complexity Revisited
• Towards Optimal Deterministic Coding for Interactive Communication
• Bridging the Capacity Gap Between Interactive and One-Way Communication
• Coding for Interactive Communication: A Survey
• Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions
• A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels
• Deterministic coding for interactive communication
• Capacity of Interactive Communication over Erasure Channels and Channels with Feedback
• Towards coding for maximum errors in interactive communication
• Interactive channel capacity

This page was built for publication: The rate of interactive codes is bounded away from 1