Improved Coding over Sets for DNA-Based Data Storage

09/18/2020
by   Hengjia Wei, et al.
0

Error-correcting codes over sets, with applications to DNA storage, are studied. The DNA-storage channel receives a set of sequences, and produces a corrupted version of the set, including sequence loss, symbol substitution, symbol insertion/deletion, and limited-magnitude errors in symbols. Various parameter regimes are studied. New bounds on code parameters are provided, which improve upon known bounds. New codes are constructed, at times matching the bounds up to lower-or der terms or small constant factors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/16/2018

Sequence-Subset Distance and Coding for Error Control in DNA-based Data Storage

The process of DNA-based data storage (DNA storage for short) can be mat...
research
02/17/2019

Zero-Error Capacity of Duplication Channels

This paper is motivated by the problem of error-free communication throu...
research
09/16/2018

Sequence-Subset Distance and Coding for Error Control in DNA Data Storage

The process of DNA data storage can be mathematically modelled as a comm...
research
12/20/2022

Index-Based Concatenated Codes for the Multi-Draw DNA Storage Channel

We consider error-correcting coding for DNA-based storage. We model the ...
research
01/15/2021

Improved Rank-Modulation Codes for DNA Storage with Shotgun Sequencing

We study permutations over the set of ℓ-grams, that are feasible in the ...
research
01/21/2019

Anchor-Based Correction of Substitutions in Indexed Sets

Motivated by DNA-based data storage, we investigate a system where digit...
research
11/13/2019

Single-Error Detection and Correction for Duplication and Substitution Channels

Motivated by mutation processes occurring in in-vivo DNA-storage applica...

Please sign up or login with your details

Forgot password? Click here to reset