Abstract-We study the problem of synchronizing two files X and Y at two distant nodes A and B that are connected through a two-way communication channel. We assume that file Y at node B is obtained from file X at node A by inserting and deleting a small fraction of symbols in X. More specifically, we consider the case where X is a non-binary non-uniform string, and deletions and insertions happen uniformly with rates β d and βi, respectively. We propose a synchronization protocol between node A and node B that needs to transmit O( bits (where n is the length of X, q is the alphabet size and H2 is the collision entropy of X) and reconstructs X at node B with error probability exponentially low in n. This protocol readily generalizes the recent result by Tabatabaei Yazdi and Dolecek that dealt with synchronization from binary uniform source and under only deletion errors.
In REF the authors designed synchronization algorithms for insertions and deletions for non-binary non-uniform sources.
Synchronization from insertions and deletions under a non-binary, non-uniform source
2013 IEEE International Symposium on Information Theory
2013 IEEE International Symposium on Information Theory
Computer Science