Sciweavers

Share
ECCC
2010

Towards Coding for Maximum Errors in Interactive Communication

9 years 6 months ago
Towards Coding for Maximum Errors in Interactive Communication
We show that it is possible to encode any communication protocol between two parties so that the protocol succeeds even if a (1/4 − ǫ) fraction of all symbols transmitted by the parties are corrupted adversarially, at a cost of increasing the communication in the protocol by a constant factor (the constant depends on epsilon). This encoding uses a constant sized alphabet. This improves on an earlier result of Schulman, who showed how to recover when the fraction of errors is bounded by 1/240. We also show how to simulate an arbitrary protocol with a protocol using the binary alphabet, a constant factor increase in communication and tolerating a 1/8 − ǫ fraction of errors.
Mark Braverman, Anup Rao
Added 25 Jan 2011
Updated 25 Jan 2011
Type Journal
Year 2010
Where ECCC
Authors Mark Braverman, Anup Rao
Comments (0)
books