Concatenated Codes for Recovery From Multiple Reads of DNA Sequences

10/29/2020
by   Andreas Lenz, et al.
0

Decoding sequences that stem from multiple transmissions of a codeword over an insertion, deletion, and substitution channel is a critical component of efficient deoxyribonucleic acid (DNA) data storage systems. In this paper, we consider a concatenated coding scheme with an outer low-density parity-check code and either an inner convolutional code or a block code. We propose two new decoding algorithms for inference from multiple received sequences, both combining the inner code and channel to a joint hidden Markov model to infer symbolwise a posteriori probabilities (APPs). The first decoder computes the exact APPs by jointly decoding the received sequences, whereas the second decoder approximates the APPs by combining the results of separately decoded received sequences. Using the proposed algorithms, we evaluate the performance of decoding multiple received sequences by means of achievable information rates and Monte-Carlo simulations. We show significant performance gains compared to a single received sequence.

READ FULL TEXT
research
11/29/2021

Concatenated Codes for Multiple Reads of a DNA Sequence

Decoding sequences that stem from multiple transmissions of a codeword o...
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
12/14/2022

Achievable Information Rates and Concatenated Codes for the DNA Nanopore Sequencing Channel

The errors occurring in DNA-based storage are correlated in nature, whic...
research
05/24/2022

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

We propose a new coding scheme, called the delayed coding (DC) scheme, f...
research
04/30/2020

Achievable Rates of Concatenated Codes in DNA Storage under Substitution Errors

In this paper, we study achievable rates of concatenated coding schemes ...
research
12/19/2022

Finite Blocklength Performance Bound for the DNA Storage Channel

We present a finite blocklength performance bound for a DNA storage chan...
research
03/13/2018

A Branch-Price-and-Cut Algorithm for Optimal Decoding of LDPC Codes

Channel coding aims to minimize errors that occur during the transmissio...

Please sign up or login with your details

Forgot password? Click here to reset