The DNA Storage Channel: Capacity and Error Probability

09/26/2021
by   Nir Weinberger, et al.
0

The DNA storage channel is considered, in which M Deoxyribonucleic acid (DNA) molecules comprising each codeword, are stored without order, then sampled N times with replacement, and the sequenced over a discrete memoryless channel. For a constant coverage depth M/N and molecule length scaling Θ(log M), lower (achievability) and upper (converse) bounds on the capacity of the channel, as well as a lower (achievability) bound on the reliability function of the channel are provided. Both the lower and upper bounds on the capacity generalize a bound which was previously known to hold only for the binary symmetric sequencing channel, and only under certain restrictions on the molecule length scaling and the crossover probability parameters. When specified to binary symmetric sequencing channel, these restrictions are completely removed for the lower bound and are significantly relaxed for the upper bound. The lower bound on the reliability function is achieved under a universal decoder, and reveals that the dominant error event is that of outage – the event in which the capacity of the channel induced by the DNA molecule sampling operation does not support the target rate.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/13/2022

On the Reliability Function for a BSC with Noiseless Feedback at Zero Rate

We consider the transmission of nonexponentially many messages through a...
research
01/28/2021

Private DNA Sequencing: Hiding Information in Discrete Noise

When an individual's DNA is sequenced, sensitive medical information bec...
research
08/20/2019

A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels

The interactive capacity of a channel is defined in this paper as the ma...
research
05/20/2022

Error Probability Bounds for Coded-Index DNA Storage

The DNA storage channel is considered, in which a codeword is comprised ...
research
05/11/2023

Improved Upper and Lower Bounds on the Capacity of the Binary Deletion Channel

The binary deletion channel with deletion probability d (BDC_d) is a ran...
research
07/15/2020

Coding Theorems for Noisy Permutation Channels

In this paper, we formally define and analyze the class of noisy permuta...
research
10/06/2021

Coded Shotgun Sequencing

Most DNA sequencing technologies are based on the shotgun paradigm: many...

Please sign up or login with your details

Forgot password? Click here to reset