Binary Interactive Error Resilience Beyond (or why
K Efremenko, G Kol, RR Saxena - 2020 IEEE 61st Annual …, 2020 - ieeexplore.ieee.org
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 …
two party communication protocol to an error-resilient protocol that succeeds even if a …
Efficient multiparty interactive coding for insertions, deletions, and substitutions
In the field of interactive coding, two or more parties wish to carry out a distributed
computation over a communication network that may be noisy. The ultimate goal is to …
computation over a communication network that may be noisy. The ultimate goal is to …
Optimal error resilience of adaptive message exchange
K Efremenko, G Kol, RR Saxena - Proceedings of the 53rd Annual ACM …, 2021 - dl.acm.org
We study the error resilience of the message exchange task: Two parties, each holding a
private input, want to exchange their inputs. However, the channel connecting them is …
private input, want to exchange their inputs. However, the channel connecting them is …
Interactive error resilience beyond 2/7
K Efremenko, G Kol, RR Saxena - Proceedings of the 52nd Annual ACM …, 2020 - dl.acm.org
Interactive error correcting codes can protect interactive communication protocols against a
constant fraction of adversarial errors, while incurring only a constant multiplicative …
constant fraction of adversarial errors, while incurring only a constant multiplicative …
Interactive Coding with Small Memory
In this work, we design an interactive coding scheme that converts any two party interactive
protocol Π into another interactive protocol Π', such that even if errors are introduced during …
protocol Π into another interactive protocol Π', such that even if errors are introduced during …
Interactive coding resilient to an unknown number of erasures
We consider distributed computations between two parties carried out over a noisy channel
that may erase messages. Following a noise model proposed by Dani et al.(2018), the noise …
that may erase messages. Following a noise model proposed by Dani et al.(2018), the noise …
Efficient multiparty interactive coding—part I: Oblivious insertions, deletions and substitutions
In the field of interactive coding, two or more parties wish to carry out a distributed
computation over a communication network that may be noisy. The ultimate goal is to …
computation over a communication network that may be noisy. The ultimate goal is to …
Interactive Coding with Unbounded Noise
Interactive coding allows two parties to conduct a distributed computation despite noise
corrupting a certain fraction of their communication. Dani et al.\@(Inf.\@ and Comp., 2018) …
corrupting a certain fraction of their communication. Dani et al.\@(Inf.\@ and Comp., 2018) …
Multiparty interactive coding over networks of intersecting broadcast links
M Mukherjee, R Gelles - IEEE Journal on Selected Areas in …, 2021 - ieeexplore.ieee.org
We consider computations over networks with multiple broadcast channels that intersect at a
single party. Each broadcast link suffers from random bit-flip noise that affects the receivers …
single party. Each broadcast link suffers from random bit-flip noise that affects the receivers …
A lower bound on the essential interactive capacity of binary memoryless symmetric channels
The essential interactive capacity of a discrete memoryless channel is defined in this paper
as the maximal rate at which the transcript of any interactive protocol can be reliably …
as the maximal rate at which the transcript of any interactive protocol can be reliably …