Coding for interactive communication correcting insertions and deletions

Mark Braverman; Ran Gelles; Jieming Mao; Rafail Ostrovsky

doi:10.4230/LIPIcs.ICALP.2016.61

Coding for interactive communication correcting insertions and deletions

Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

9 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 designed to replace the Hamming distance constraints in Schulman's tree codes (STOC 93), with a stronger edit distance requirement. However, the straightforward generalization of tree codes to edit distance does not seem to yield a primitive that suffices for communication in the presence of synchronization problems. Giving the "right" definition of edit distance tree codes is a main conceptual contribution of this work.

Original language	English
Title of host publication	43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016
Editors	Yuval Rabani, Ioannis Chatzigiannakis, Davide Sangiorgi, Michael Mitzenmacher
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959770132
DOIs	https://doi.org/10.4230/LIPIcs.ICALP.2016.61
State	Published - 1 Aug 2016
Externally published	Yes
Event	43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 - Rome, Italy Duration: 12 Jul 2016 → 15 Jul 2016

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	55
ISSN (Print)	1868-8969

Conference

Conference	43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016
Country/Territory	Italy
City	Rome
Period	12/07/16 → 15/07/16

Bibliographical note

Funding Information:
Mark Braverman is supported in part by an NSF CAREER award (CCF-1149888), NSF CCF-1215990, a Turing Centenary Fellowship, a Packard Fellowship in Science and Engineering, and the Simons Collaboration on Algorithms and Geometry. Rafail Ostrovsky is supported in part by NSF grants 09165174, 1065276, 1118126 and 1136174, DARPA, US-Israel BSF grant 2008411, OKAWA Foundation Research Award, IBM Faculty Research Award, Xerox Faculty Research Award, B. John Garrick Foundation Award, Teradata Research Award, and Lockheed-Martin Corporation Research Award. The views expressed are those of the author and do not reflect the official policy or position of the Department of Defense or the U.S. Government

Keywords

Coding
Edit distance
Interactive communication

Access to Document

10.4230/LIPIcs.ICALP.2016.61

Cite this

Braverman, M., Gelles, R., Mao, J., & Ostrovsky, R. (2016). Coding for interactive communication correcting insertions and deletions. In Y. Rabani, I. Chatzigiannakis, D. Sangiorgi, & M. Mitzenmacher (Eds.), 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 Article 61 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 55). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2016.61

Braverman, Mark ; Gelles, Ran ; Mao, Jieming et al. / Coding for interactive communication correcting insertions and deletions. 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. editor / Yuval Rabani ; Ioannis Chatzigiannakis ; Davide Sangiorgi ; Michael Mitzenmacher. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{596a5b9da97f463db0fd3e9dbae0db22,

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 designed to replace the Hamming distance constraints in Schulman's tree codes (STOC 93), with a stronger edit distance requirement. However, the straightforward generalization of tree codes to edit distance does not seem to yield a primitive that suffices for communication in the presence of synchronization problems. Giving the {"}right{"} definition of edit distance tree codes is a main conceptual contribution of this work.",

keywords = "Coding, Edit distance, Interactive communication",

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

note = "Funding Information: Mark Braverman is supported in part by an NSF CAREER award (CCF-1149888), NSF CCF-1215990, a Turing Centenary Fellowship, a Packard Fellowship in Science and Engineering, and the Simons Collaboration on Algorithms and Geometry. Rafail Ostrovsky is supported in part by NSF grants 09165174, 1065276, 1118126 and 1136174, DARPA, US-Israel BSF grant 2008411, OKAWA Foundation Research Award, IBM Faculty Research Award, Xerox Faculty Research Award, B. John Garrick Foundation Award, Teradata Research Award, and Lockheed-Martin Corporation Research Award. The views expressed are those of the author and do not reflect the official policy or position of the Department of Defense or the U.S. Government; 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 ; Conference date: 12-07-2016 Through 15-07-2016",

year = "2016",

month = aug,

day = "1",

doi = "10.4230/LIPIcs.ICALP.2016.61",

language = "אנגלית",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Yuval Rabani and Ioannis Chatzigiannakis and Davide Sangiorgi and Michael Mitzenmacher",

booktitle = "43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016",

address = "גרמניה",

}

Braverman, M, Gelles, R, Mao, J & Ostrovsky, R 2016, Coding for interactive communication correcting insertions and deletions. in Y Rabani, I Chatzigiannakis, D Sangiorgi & M Mitzenmacher (eds), 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016., 61, Leibniz International Proceedings in Informatics, LIPIcs, vol. 55, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, Rome, Italy, 12/07/16. https://doi.org/10.4230/LIPIcs.ICALP.2016.61

Coding for interactive communication correcting insertions and deletions. / Braverman, Mark; Gelles, Ran; Mao, Jieming et al.
43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. ed. / Yuval Rabani; Ioannis Chatzigiannakis; Davide Sangiorgi; Michael Mitzenmacher. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. 61 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 55).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Coding for interactive communication correcting insertions and deletions

AU - Braverman, Mark

AU - Gelles, Ran

AU - Mao, Jieming

AU - Ostrovsky, Rafail

N1 - Funding Information: Mark Braverman is supported in part by an NSF CAREER award (CCF-1149888), NSF CCF-1215990, a Turing Centenary Fellowship, a Packard Fellowship in Science and Engineering, and the Simons Collaboration on Algorithms and Geometry. Rafail Ostrovsky is supported in part by NSF grants 09165174, 1065276, 1118126 and 1136174, DARPA, US-Israel BSF grant 2008411, OKAWA Foundation Research Award, IBM Faculty Research Award, Xerox Faculty Research Award, B. John Garrick Foundation Award, Teradata Research Award, and Lockheed-Martin Corporation Research Award. The views expressed are those of the author and do not reflect the official policy or position of the Department of Defense or the U.S. Government

PY - 2016/8/1

Y1 - 2016/8/1

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 designed to replace the Hamming distance constraints in Schulman's tree codes (STOC 93), with a stronger edit distance requirement. However, the straightforward generalization of tree codes to edit distance does not seem to yield a primitive that suffices for communication in the presence of synchronization problems. Giving the "right" definition of edit distance tree codes is a main conceptual contribution of this work.

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 designed to replace the Hamming distance constraints in Schulman's tree codes (STOC 93), with a stronger edit distance requirement. However, the straightforward generalization of tree codes to edit distance does not seem to yield a primitive that suffices for communication in the presence of synchronization problems. Giving the "right" definition of edit distance tree codes is a main conceptual contribution of this work.

KW - Coding

KW - Edit distance

KW - Interactive communication

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

U2 - 10.4230/LIPIcs.ICALP.2016.61

DO - 10.4230/LIPIcs.ICALP.2016.61

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85012940595

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016

A2 - Rabani, Yuval

A2 - Chatzigiannakis, Ioannis

A2 - Sangiorgi, Davide

A2 - Mitzenmacher, Michael

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016

Y2 - 12 July 2016 through 15 July 2016

ER -

Braverman M, Gelles R, Mao J, Ostrovsky R. Coding for interactive communication correcting insertions and deletions. In Rabani Y, Chatzigiannakis I, Sangiorgi D, Mitzenmacher M, editors, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2016. 61. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.ICALP.2016.61

Coding for interactive communication correcting insertions and deletions

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this