Synchronization from deletions through interactive communication

In this paper we consider a synchronization problem between nodes A and B that are connected through a two-way communication channel. Node A contains a binary file X of length n and node B contains a binary file Y that is generated by randomly deleting bits from X, by a small deletion rate β. We offer a deterministic synchronization scheme between nodes A and B that needs O(nβ log 1/β)1 transmissions to reconstruct X at node B. The rate of our scheme matches the optimal rate for this channel up to a multiplicative constant and the running time of our scheme is O(n4β6).

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[3]  M. Mitzenmacher.  A survey of results for deletion channels and related synchronization channels , 2009 .

[4]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[5]  Kannan Ramchandran,et al.  Efficient file synchronization: A distributed source coding approach , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[6]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[7]  Kannan Ramchandran,et al.  Achievable Rates for Channels With Deletions and Insertions , 2011, IEEE Transactions on Information Theory.

[8]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[9]  Alon Orlitsky,et al.  One-way communication and error-correcting codes , 2003, IEEE Transactions on Information Theory.

[10]  Kannan Ramchandran,et al.  Interactive low-complexity codes for synchronization from deletions and insertions , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[11]  Michael Mitzenmacher,et al.  A Survey of Results for Deletion Channels and Related Synchronization Channels , 2008, SWAT.

[12]  Adam Tauman Kalai,et al.  Tight asymptotic bounds for the deletion channel with small deletion probabilities , 2010, 2010 IEEE International Symposium on Information Theory.

[13]  Yashodhan Kanoria,et al.  On the deletion channel with small deletion probability , 2009, 2010 IEEE International Symposium on Information Theory.