Multilayer Codes for Synchronization from Deletions
Consider two remote nodes, each having a binary sequence. The sequence at one node differs from the other by a small number of deletions. The node with the shorter sequence wishes to reconstruct the longer sequence using minimal information from the other node. In this paper, we devise a coding scheme for this one-way synchronization model. The scheme is based on multiple layers of Varshamov-Tenenglots codes combined with off-the-shelf linear error-correcting codes.
PDF AbstractCategories
Information Theory
Information Theory
Datasets
Add Datasets
introduced or used in this paper