Uncertainty of Reconstructing Multiple Messages from Uniform-Tandem-Duplication Noise

01/20/2020
by   Yonatan Yehezkeally, et al.
0

A growing number of works have, in recent years, been concerned with in-vivo DNA as medium for data storage. This paper extends the concept of reconstruction codes for uniform-tandem-duplication noise to the model of associative memory, by finding the uncertainty associated with m>2 strings (where a previous paper considered m=2). That uncertainty is found as an asymptotic expression assuming code-words belong to a typical set of strings, consisting a growing fraction of the space size, converging to 1. Our findings show that this uncertainty scales polynomially in the message length.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
08/26/2021

Multi-strand Reconstruction from Substrings

The problem of string reconstruction based on its substrings spectrum ha...
research
10/05/2021

Reconstruction of Sets of Strings from Prefix/Suffix Compositions

The problem of reconstructing strings from substring information has fou...
research
01/18/2018

Reconstruction Codes for DNA Sequences with Uniform Tandem-Duplication Errors

DNA as a data storage medium has several advantages, including far great...
research
10/21/2020

Reconstructing Mixtures of Coded Strings from Prefix and Suffix Compositions

The problem of string reconstruction from substring information has foun...
research
10/10/2022

Generalized Unique Reconstruction from Substrings

This paper introduces a new family of reconstruction codes which is moti...
research
11/30/2020

Batch Optimization for DNA Synthesis

Large pools of synthetic DNA molecules have been recently used to reliab...

Please sign up or login with your details

Forgot password? Click here to reset