To refer to this page use:
|Abstract:||In this paper, we extend the notion of list decoding to the setting of interactive communication and study its limits. In particular, we show that any protocol can be encoded, with a constant rate, into a list-decodable protocol which is resilient to a noise rate of up to 1/2 - ϵ, and that this is tight. Using our list-decodable construction, we study a more nuanced model of noise where the adversary can corrupt up to a fraction α of Alice's communication and up to a fraction β of Bob's communication. We use list decoding to characterize fully the region RU of pairs (α, β) for which unique decoding with a constant rate is possible. The region RU turns out to be quite unusual in its shape. In particular, it is bounded by a piecewise-differentiable curve with infinitely many pieces. We show that outside this region the rate must be exponential. This suggests that in some error regimes, list decoding is necessary for optimal unique decoding. We also consider the setting where only one party of the communication must output the correct answer. We precisely characterize the region of all pairs (α, β) for which one-sided unique decoding is possible in such a way that Alice will output the correct answer.|
|Citation:||Braverman, M, Efremenko, K. (2017). LIST and unique coding for interactive communication in the presence of adversarial noise. SIAM Journal on Computing, 46 (388 - 428. doi:10.1137/141002001|
|Pages:||388 - 428|
|Type of Material:||Journal Article|
|Journal/Proceeding Title:||SIAM Journal on Computing|
|Version:||Final published version. This is an open access article.|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.