Single-Error Detection and Correction for Duplication and Substitution Channels

11/13/2019
by   Yuanyuan Tang, et al.
0

Motivated by mutation processes occurring in in-vivo DNA-storage applications, a channel that mutates stored strings by duplicating substrings as well as substituting symbols is studied. Two models of such a channel are considered: one in which the substitutions occur only within the duplicated substrings, and one in which the location of substitutions is unrestricted. Both error-detecting and error-correcting codes are constructed, which can handle correctly any number of tandem duplications of a fixed length k, and at most a single substitution occurring at any time during the mutation process.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/17/2019

Zero-Error Capacity of Duplication Channels

This paper is motivated by the problem of error-free communication throu...
research
11/11/2020

Error-correcting Codes for Short Tandem Duplication and Substitution Errors

Due to its high data density and longevity, DNA is considered a promisin...
research
02/02/2021

On Codes for the Noisy Substring Channel

We consider the problem of coding for the substring channel, in which in...
research
09/18/2020

Improved Coding over Sets for DNA-Based Data Storage

Error-correcting codes over sets, with applications to DNA storage, are ...
research
12/22/2021

On the Reverse-Complement String-Duplication System

Motivated by DNA storage in living organisms, and by known biological mu...
research
05/15/2022

Optimal Error-Detecting Codes for General Asymmetric Channels via Sperner Theory

Several communication models that are of relevance in practice are asymm...

Please sign up or login with your details

Forgot password? Click here to reset