Multiparty Interactive Coding over Networks of Intersecting Broadcast Links

by   Manuj Mukherjee, et al.

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 independently. We design interactive coding schemes that successfully perform any computation over these noisy networks and strive to reduce their communication overhead with respect to the original (noiseless) computation. A simple variant of a coding scheme by Rajagopalan and Schulman (STOC 1994) shows that any (noiseless) protocol of R rounds can be reliably simulated in O(Rlog n) rounds over a network with n=n_1n_2+1 parties in which a single party is connected to n_2 noisy broadcast channels, each of which connects n_1 distinct parties. We design new coding schemes with improved overheads. Our approach divides the network into four regimes according to the relationship between n_1 and n_2. We employ a two-layer coding where the inner code protects each broadcast channel and is tailored to the specific conditions of the regime in consideration. The outer layer protects the computation in the network and is generally based on the scheme of Rajagopalan and Schulman, adapted to the case of broadcast channels. The overhead we obtain ranges from O(loglog n_2) to O(log n_2 loglog n_1/log n_1) and beats the trivial O(log n) overhead in all four regimes.



There are no comments yet.


page 1

page 2

page 3

page 4


Interactive coding resilient to an unknown number of erasures

We consider distributed computations between two parties carried out ove...

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

Classically, coding theory has been concerned with the problem of transm...

Polar Coding for the Wiretap Broadcast Channel with Multiple Messages

A polar coding scheme is proposed for the Wiretap Broadcast Channel with...

Efficient Multiparty Interactive Coding for Insertions, Deletions and Substitutions

In the field of interactive coding, two or more parties wish to carry ou...

Characterization of Secure Multiparty Computation Without Broadcast

A major challenge in the study of cryptography is characterizing the nec...

Erasure Correction for Noisy Radio Networks

The radio network model is a well-studied abstraction for modeling wirel...

On the Separability of Parallel MISO Broadcast Channels Under Partial CSIT: A Degrees of Freedom Region Perspective

We study the K-user, M-subchannel parallel multiple-input-single-output ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.