Interactive coding resilient to an unknown number of erasures

Ran Gelles, Siddharth Iyer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

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 level observed by the parties during the computation in our setting is arbitrary and a priori unknown to the parties. We develop interactive coding schemes that adapt to the actual level of noise and correctly execute any two-party computation. Namely, in case the channel erases T transmissions, the coding scheme will take N + 2T transmissions using an alphabet of size 4 (alternatively, using 2N + 4T transmissions over a binary channel) to correctly simulate any binary protocol that takes N transmissions assuming a noiseless channel. We can further reduce the communication to N + T by relaxing the communication model and allowing parties to remain silent rather than forcing them to communicate in every round of the coding scheme. Our coding schemes are efficient, deterministic, have linear overhead both in their communication and round complexity, and succeed (with probability 1) regardless of the number of erasures T.

Original languageEnglish
Title of host publication23rd International Conference on Principles of Distributed Systems, OPODIS 2019
EditorsPascal Felber, Roy Friedman, Seth Gilbert, Avery Miller
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771337
DOIs
StatePublished - Feb 2020
Event23rd International Conference on Principles of Distributed Systems, OPODIS 2019 - Neuchatel, Switzerland
Duration: 17 Dec 201919 Dec 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume153
ISSN (Print)1868-8969

Conference

Conference23rd International Conference on Principles of Distributed Systems, OPODIS 2019
Country/TerritorySwitzerland
CityNeuchatel
Period17/12/1919/12/19

Bibliographical note

Publisher Copyright:
© Ran Gelles and Siddharth Iyer; licensed under Creative Commons License CC-BY 23rd International Conference on Principles of Distributed Systems (OPODIS 2019).

Funding

Research supported in part by the Israel Science Foundation (ISF) through grant No. 1078/17.

FundersFunder number
Israel Science Foundation1078/17

    Keywords

    • And phrases Interactive coding
    • Distributed computation with noise
    • Erasure channels
    • Unbounded noise

    Fingerprint

    Dive into the research topics of 'Interactive coding resilient to an unknown number of erasures'. Together they form a unique fingerprint.

    Cite this