Efficient Multiparty Interactive Coding for Insertions, Deletions and Substitutions

01/28/2019
by   Ran Gelles, et al.
0

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 develop efficient coding schemes that can tolerate a high level of noise while increasing the communication by only a constant factor (i.e., constant rate). In this work we consider synchronous communication networks over an arbitrary topology, in the powerful adversarial insertion-deletion noise model. Namely, the noisy channel may adversarially alter the content of any transmitted symbol, as well as completely remove a transmitted symbol or inject a new symbol into the channel. We provide efficient, constant rate schemes that successfully conduct any computation with high probability as long as the adversary corrupts at most ε /m fraction of the total communication, where m is the number of links in the network and ε is a small constant. This scheme assumes the parties share a random string to which the adversarial noise is oblivious. We can remove this assumption at the price of being resilient to ε / (m m) adversarial error. While previous work considered the insertion-deletion noise model in the two-party setting, to the best of our knowledge, our scheme is the first multiparty scheme that is resilient to insertions and deletions. Furthermore, our scheme is the first computationally efficient scheme in the multiparty setting that is resilient to adversarial noise.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/06/2018

Interactive coding resilient to an unknown number of erasures

We consider distributed computations between two parties carried out ove...
research
07/03/2022

Efficient Interactive Coding Achieving Optimal Error Resilience Over the Binary Channel

Given a noiseless protocol π_0 computing a function f(x, y) of Alice and...
research
04/09/2018

A Tamper-Free Semi-Universal Communication System for Deletion Channels

We investigate the problem of reliable communication between two legitim...
research
09/15/2019

Noisy Beeping Networks

We introduce noisy beeping networks, where nodes have limited communicat...
research
05/17/2018

Coding for Interactive Communication with Small Memory and Applications to Robust Circuits

Classically, coding theory has been concerned with the problem of transm...
research
05/04/2021

Multiparty Interactive Coding over Networks of Intersecting Broadcast Links

We consider computations over networks with multiple broadcast channels ...
research
05/07/2018

Covert Communication over Adversarially Jammed Channels

We consider a situation in which a transmitter Alice may wish to communi...

Please sign up or login with your details

Forgot password? Click here to reset