Low-Complexity Interactive Algorithms for Synchronization from Deletions, Insertions, and Substitutions

Consider two remote nodes having binary sequences \(X\) and \(Y\), respectively. \(Y\) is an edited version of \({X}\), where the editing involves random deletions, insertions, and substitutions, possibly in bursts. The goal is for the node with \(Y\) to reconstruct \(X\) with minimal exchange of in...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2015-09
Hauptverfasser:	Venkataramanan, Ramji, Vasuki Narasimha Swamy, Ramchandran, Kannan
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Bursts Communication Complexity Computer Science - Data Structures and Algorithms Computer Science - Information Theory Computer simulation Deletion Exchanging Mathematics - Information Theory Synchronism
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!