The rate of interactive codes is bounded away from 1

DOI10.1145/3564246.3585249MaRDI QIDQ6499313zbMATH OpenFDO

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

Publication date 8 May 2024

zbMATH Keywords

communication complexityerror correcting codesinteractive coding

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1256711 (Why is no real title available?)
• scientific article; zbMATH DE number 7650355 (Why is no real title available?)
• A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels
• A Mathematical Theory of Communication
• Bridging the capacity gap between interactive and one-way communication
• Capacity of interactive communication over erasure channels and channels with feedback
• Coding for interactive communication: a survey
• Deterministic coding for interactive communication
• Interactive channel capacity
• Rounds in Communication Complexity Revisited
• Synchronization strings: channel simulations and interactive coding for insertions and deletions
• Towards coding for maximum errors in interactive communication
• Towards optimal deterministic coding for interactive communication

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)