A Single-Round File Synchronization Scheme From Insertions and Deletions With Low Redundancy

Consider a file synchronization problem at two remote nodes A and B connected by a noiseless link. The node A has a binary file $X$ , and node B has a binary file $Y$ which is an edited version of $X$ with random insertions and deletions (indels). The goal is to reconstruct $X$ at node B from $Y$ with minimal exchange of information between A and B. In this letter, we design a single-round, thus low latency, file synchronization scheme with low redundancy. In particular, a series of redundancy bits, including markers, check symbols of Reed-Solomon (RS) codes for hashes and Varshamov-Tenengolts (VT) syndromes, are constructed from $X$ at node A and send to node B. According to the received redundancy and $Y$ , we develop a recovery algorithm at node B to reconstruct $X$ . The amount of exchanged information of the proposed scheme is significantly reduced when compared with the existing single-round synchronization scheme under random indels.