Skip to main content

Coding for Interactive Communication Correcting Insertions and Deletions

Author(s): Braverman, Mark; Gelles, R; Mao, J; Ostrovsky, R

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1jh50
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.
Publication Date: Oct-2017
Electronic Publication Date: 2-Aug-2017
Citation: Braverman, M, Gelles, R, Mao, J, Ostrovsky, R. (2017). Coding for Interactive Communication Correcting Insertions and Deletions. IEEE Transactions on Information Theory, 63 (6256 - 6270. doi:10.1109/TIT.2017.2734881
DOI: doi:10.1109/TIT.2017.2734881
Pages: 6256 - 6270
Type of Material: Journal Article
Journal/Proceeding Title: IEEE Transactions on Information Theory
Version: Author's manuscript



Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.