8 research outputs found
Efficient Systematic Encoding of Non-binary VT Codes
Varshamov-Tenengolts (VT) codes are a class of codes which can correct a
single deletion or insertion with a linear-time decoder. This paper addresses
the problem of efficient encoding of non-binary VT codes, defined over an
alphabet of size . We propose a simple linear-time encoding method to
systematically map binary message sequences onto VT codewords. The method
provides a new lower bound on the size of -ary VT codes of length .Comment: This paper will appear in the proceedings of ISIT 201
Multilayer codes for synchronization from deletions
A coding scheme is proposed for synchronization from a small number of deletions via a one-way error-free link. The scheme is based on multiple layers of Varshamov-Tenengolts codes combined with off-the-shelf linear error-correcting codes
Multilayer Codes for Synchronization from Deletions and Insertions
Consider two remote nodes (encoder and decoder), each with a binary sequence. The encoder's sequence X differs from the decoder's sequence Y by a small number of edits (deletions and insertions). The goal is to construct a message M, to be sent via a one-way error free link, such that the decoder can reconstruct X using M and Y. In this paper, we devise a coding scheme for this one-way synchronization model. The scheme is based on multiple layers of Varshamov-Tenengolts (VT) codes combined with off-the-shelf linear error-correcting codes, and uses a list decoder. We bound the expected list size of the decoder under certain assumptions, and validate its performance via numerical simulations. We also consider an alternative decoder that uses only the constraints from the VT codes (i.e., does not require a linear code), and has a smaller redundancy at the expense of a slightly larger average list size
Multilayer Codes for Synchronization from Deletions and Insertions
Consider two remote nodes (encoder and decoder), each with a binary sequence. The encoder’s sequence X differs from the decoder’s sequence Y by a small number of edits (deletions and insertions). The goal is to construct a message M, to be sent via a one-way error free link, such that the decoder can reconstruct X using M and Y . In this paper, we devise a coding scheme for this one-way synchronization model. The scheme is based on multiple layers of Varshamov-Tenengolts (VT) codes combined with off-the-shelf linear error-correcting codes, and uses a list decoder. We bound the expected list size of the decoder under certain assumptions, and validate its performance via numerical simulations. We also consider an alternative decoder that uses only the constraints from the VT codes (i.e., does not require a linear code), and has a smaller redundancy at the expense of a slightly larger average list size.ERC Grant ITU