TY - JOUR

T1 - Multiparty Interactive Coding over Networks of Intersecting Broadcast Links

AU - Mukherjee, Manuj

AU - Gelles, Ran

N1 - Publisher Copyright:
© 2020 IEEE.

PY - 2021/12/1

Y1 - 2021/12/1

N2 - 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(R\log n)$ rounds over a network with $n=n_{1}n_{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(\log \log n_{2})$ to $O\left({\log n_{2} \frac {\log \log n_{1}}{\log n_{1}}}\right)$ and beats the trivial $O(\log n)$ overhead in all four regimes.

AB - 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(R\log n)$ rounds over a network with $n=n_{1}n_{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(\log \log n_{2})$ to $O\left({\log n_{2} \frac {\log \log n_{1}}{\log n_{1}}}\right)$ and beats the trivial $O(\log n)$ overhead in all four regimes.

KW - Distributed communication

KW - interactive coding

KW - multiparty interactive communication

UR - http://www.scopus.com/inward/record.url?scp=85131456812&partnerID=8YFLogxK

U2 - 10.1109/JSAIT.2021.3126422

DO - 10.1109/JSAIT.2021.3126422

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85131456812

SN - 2641-8770

VL - 2

SP - 1078

EP - 1092

JO - IEEE Journal on Selected Areas in Information Theory

JF - IEEE Journal on Selected Areas in Information Theory

IS - 4

ER -