Coding for Interactive Communication Correcting Insertions and Deletions

Mark Braverman; Ran Gelles; Jieming Mao; Rafail Ostrovsky

doi:10.1109/TIT.2017.2734881

Coding for Interactive Communication Correcting Insertions and Deletions

Mark Braverman
, Ran Gelles
, Jieming Mao
, Rafail Ostrovsky

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Research output: Contribution to journal › Article › peer-review

37 Scopus citations

Abstract

We consider the question of interactive communication, in which two remote parties perform a computation, while their communication channel is (adversarially) noisy. We extend here the discussion into a more general and stronger class of noise, namely, we allow the channel to perform insertions and deletions of symbols. These types of errors may bring the parties 'out of sync,' so that there is no consensus regarding the current round of the protocol. In this more general noise model, we obtain the first interactive coding scheme that has a constant rate and tolerates noise rates of up to 1/18-ϵ . To this end, we develop a novel primitive we name edit-distance tree code. The edit-distance tree code is carefully designed to replace the Hamming distance constraints in Schulman's tree codes (IEEE Trans. Inf. Theory, 1996), with a stronger edit-distance requirement.

Original language	English
Article number	8000379
Pages (from-to)	6256-6270
Number of pages	15
Journal	IEEE Transactions on Information Theory
Volume	63
Issue number	10
DOIs	https://doi.org/10.1109/TIT.2017.2734881
State	Published - Oct 2017

Bibliographical note

Publisher Copyright:
© 2017 IEEE.

Funding

Manuscript received May 29, 2016; revised November 21, 2016 and May 27, 2017; accepted July 17, 2017. Date of publication August 2, 2017; date of current version September 13, 2017. This work was supported in part by the NSF CAREER under Award CCF-1149888, in part by NSF under Grant CCF-1215990, in part by the Turing Centenary Fellowship, in part by the Packard Fellowship in Science and Engineering, in part by the Simons Collaboration on Algorithms and Geometry, in part by NSF under Grant 09165174, Grant 1065276, Grant 1118126, and Grant 1136174, in part by DARPA, in part by the U.S.–Israel BSF under Grant 2008411, in part by the OKAWA Foundation Research Award, in part by the IBM Faculty Research Award, in part by the Xerox Faculty Research Award, in part by the B. John Garrick Foundation Award, in part by the Teradata Research Award, and in part by the Lockheed-Martin Corporation Research Award. A short version of this paper [9] was presented at the 2016 ICALP.

Funders	Funder number
U.S.-Israel BSF	2008411
National Science Foundation	CCF-1149888, CCF-1215990, 09165174
Directorate for Computer and Information Science and Engineering	1215990, 1118126, 1149888, 1065276, 1136174
Defense Advanced Research Projects Agency
International Business Machines Corporation
B. John Garrick Foundation for the Advancement of the Risk Sciences
Okawa Foundation for Information and Telecommunications

Keywords

Interactive communication
adversarial noise
coding protocols
noise resilience

Access to Document

10.1109/TIT.2017.2734881

Cite this

@article{8e9c9d099bfe4dee8df16e9a6acac378,

title = "Coding for Interactive Communication Correcting Insertions and Deletions",

abstract = "We consider the question of interactive communication, in which two remote parties perform a computation, while their communication channel is (adversarially) noisy. We extend here the discussion into a more general and stronger class of noise, namely, we allow the channel to perform insertions and deletions of symbols. These types of errors may bring the parties 'out of sync,' so that there is no consensus regarding the current round of the protocol. In this more general noise model, we obtain the first interactive coding scheme that has a constant rate and tolerates noise rates of up to 1/18-ϵ . To this end, we develop a novel primitive we name edit-distance tree code. The edit-distance tree code is carefully designed to replace the Hamming distance constraints in Schulman's tree codes (IEEE Trans. Inf. Theory, 1996), with a stronger edit-distance requirement.",

keywords = "Interactive communication, adversarial noise, coding protocols, noise resilience",

author = "Mark Braverman and Ran Gelles and Jieming Mao and Rafail Ostrovsky",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.",

year = "2017",

month = oct,

doi = "10.1109/TIT.2017.2734881",

language = "אנגלית",

volume = "63",

pages = "6256--6270",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10",

}

TY - JOUR

T1 - Coding for Interactive Communication Correcting Insertions and Deletions

AU - Braverman, Mark

AU - Gelles, Ran

AU - Mao, Jieming

AU - Ostrovsky, Rafail

PY - 2017/10

Y1 - 2017/10

N2 - We consider the question of interactive communication, in which two remote parties perform a computation, while their communication channel is (adversarially) noisy. We extend here the discussion into a more general and stronger class of noise, namely, we allow the channel to perform insertions and deletions of symbols. These types of errors may bring the parties 'out of sync,' so that there is no consensus regarding the current round of the protocol. In this more general noise model, we obtain the first interactive coding scheme that has a constant rate and tolerates noise rates of up to 1/18-ϵ . To this end, we develop a novel primitive we name edit-distance tree code. The edit-distance tree code is carefully designed to replace the Hamming distance constraints in Schulman's tree codes (IEEE Trans. Inf. Theory, 1996), with a stronger edit-distance requirement.

AB - We consider the question of interactive communication, in which two remote parties perform a computation, while their communication channel is (adversarially) noisy. We extend here the discussion into a more general and stronger class of noise, namely, we allow the channel to perform insertions and deletions of symbols. These types of errors may bring the parties 'out of sync,' so that there is no consensus regarding the current round of the protocol. In this more general noise model, we obtain the first interactive coding scheme that has a constant rate and tolerates noise rates of up to 1/18-ϵ . To this end, we develop a novel primitive we name edit-distance tree code. The edit-distance tree code is carefully designed to replace the Hamming distance constraints in Schulman's tree codes (IEEE Trans. Inf. Theory, 1996), with a stronger edit-distance requirement.

KW - Interactive communication

KW - adversarial noise

KW - coding protocols

KW - noise resilience

UR - https://www.scopus.com/pages/publications/85028912904

U2 - 10.1109/TIT.2017.2734881

DO - 10.1109/TIT.2017.2734881

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

AN - SCOPUS:85028912904

SN - 0018-9448

VL - 63

SP - 6256

EP - 6270

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 10

M1 - 8000379

ER -

Coding for Interactive Communication Correcting Insertions and Deletions

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this