@inproceedings{97d7453f97e94627920547637e422415,
title = "Binary Interactive Error Resilience Beyond 1/8 (or why (½)3>1/8)",
abstract = "Interactive error correcting codesInteractive error correcting codes are codes that encode a two party communication protocol to an error-resilient protocol that succeeds even if a constant fraction of the communicated symbols are adversarially corrupted, at the cost of increasing the communication by a constant factor. What is the largest fraction of corruptions that such codes can protect against? If the error-resilient protocol is allowed to communicate large (constant sized) symbols, Braverman and Rao (STOC, 2011) show that the maximum rate of corruptions that can be tolerated is ¼. They also give a binary interactive error correcting protocol that only communicates bits and is resilient to ½ fraction of errors, but leave the optimality of this scheme as an open problem. We answer this question in the negative, breaking the 1/8 barrier. Specifically, we give a binary interactive error correcting scheme that is resilient to 5/39 > 1/8 fraction of adversarial errors. Our scheme builds upon a novel construction of binary list-decodable interactive codes with small list size.",
keywords = "Communication Complexity, Error Resilience, Interactive Coding",
author = "Klim Efremenko and Gillat Kol and Saxena, {Raghuvansh R.}",
note = "Publisher Copyright: {\textcopyright} 2020 IEEE.; 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020 ; Conference date: 16-11-2020 Through 19-11-2020",
year = "2020",
month = nov,
day = "19",
doi = "10.1109/FOCS46700.2020.00051",
language = "English",
isbn = "978-1-7281-9622-0",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "Institute of Electrical and Electronics Engineers",
pages = "470--481",
booktitle = "Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020",
address = "United States",
}