Arrow Research search
Back to STOC

STOC 2013

Interactive channel capacity

Conference Paper 8B Algorithms and Complexity · Theoretical Computer Science

Abstract

We study the interactive channel capacity of an ε-noisy channel. The interactive channel capacity C(ε) is defined as the minimal ratio between the communication complexity of a problem (over a non-noisy channel), and the communication complexity of the same problem over the binary symmetric channel with noise rate ε, where the communication complexity tends to infinity.

Authors

Keywords

  • communication complexity
  • the entropy function
  • interactive channel capacity
  • information theory

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
577875046649895289
v2026.09.13