Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
- 20 June 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 62 (8) , 4575-4588
Abstract
We provide tight upper and lower bounds on the noise resilience of interactive communication over noisy channels with feedback. In this setting, we show that the maximal fraction of noise that any nonadaptive protocol can withstand is 1/3. In addition, we provide a simple and efficient nonadaptive coding scheme that succeeds as long as the fraction of noise is at most 1/3 - ε. Surprisingly, both bounds hold regardless of whether the parties send bits or symbols from an arbitrarily large alphabet. We also consider interactive communication over erasure channels. We provide a coding scheme that withstands the optimal tolerable erasure rate of 1/2 - ε [Franklin et al., IEEE Trans. Info. Theory, 2015], but operates in a much simpler and more efficient way than the previous schemes. Our coding scheme works with an alphabet of size 4, in contrast to prior schemes in which the alphabet size grows as ε → 0. Building on the above algorithm with a fixed alphabet size, we are able to devise a protocol for binary erasure channels that tolerates erasure rates of up to 1/3 - ε.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Towards Optimal Deterministic Coding for Interactive Communication2015
- Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback2015
- Capacity of Interactive Communication over Erasure Channels and Channels with Feedback2014
- Optimal Coding for Streaming Authentication and Interactive CommunicationIEEE Transactions on Information Theory, 2014
- Toward Coding for Maximum Errors in Interactive CommunicationIEEE Transactions on Information Theory, 2014
- Optimal Coding for Streaming Authentication and Interactive CommunicationLecture Notes in Computer Science, 2013
- Efficient and Explicit Coding for Interactive Communication2011
- A mathematical theory of communicationACM SIGMOBILE Mobile Computing and Communications Review, 2001
- Bounds on mixed binary/ternary codesIEEE Transactions on Information Theory, 1998
- Coding for interactive communicationIEEE Transactions on Information Theory, 1996