DeepAI AI Chat
Log In Sign Up

Coding for Deletion Channels with Multiple Traces

by   Mahed Abroshan, et al.

Motivated by the sequence reconstruction problem from traces in DNA-based storage, we consider the problem of designing codes for the deletion channel when multiple observations (or traces) are available to the decoder. We propose simple binary and non-binary codes based on Varshamov-Tenengolts (VT) codes. The proposed codes split the codeword in blocks and employ a VT code in each block. The availability of multiple traces helps the decoder to identify deletion-free copies of a block, and to avoid mis-synchronization while decoding. The encoding complexity of the proposed scheme is linear in the codeword length; the decoding complexity is linear in the codeword length, and quadratic in the number of deletions and the number of traces. The proposed scheme offers an explicit low-complexity technique for correcting deletions using multiple traces.


page 1

page 2

page 3

page 4


Coding for Trace Reconstruction over Multiple Channels with Vanishing Deletion Probabilities

Motivated by DNA-based storage applications, we study the problem of rec...

Coded trace reconstruction in a constant number of traces

The coded trace reconstruction problem asks to construct a code C⊂{0,1}^...

Delayed Coding Scheme for Channels with Insertion, Deletion, and Substitution Errors

We propose a new coding scheme, called the delayed coding (DC) scheme, f...

Coded trace reconstruction

Motivated by average-case trace reconstruction and coding for portable D...

Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage

Sequencing a DNA strand, as part of the read process in DNA storage, pro...

Decoding algorithms of monotone codes and azinv codes and their unified view

This paper investigates linear-time decoding algorithms for two classes ...

Optimal Reconstruction Codes for Deletion Channels

The sequence reconstruction problem, introduced by Levenshtein in 2001, ...