English
Related papers

Related papers: Error Probability Bounds for Coded-Index DNA Stora…

200 papers

Motivated by DNA-based storage applications, we study the problem of reconstructing a coded sequence from multiple traces. We consider the model where the traces are outputs of independent deletion channels, where each channel deletes each…

Information Theory · Computer Science 2022-07-13 Serge Kas Hanna

DNA is a leading candidate as the next archival storage media due to its density, durability and sustainability. To read (and write) data DNA storage exploits technology that has been developed over decades to sequence naturally occurring…

Emerging Technologies · Computer Science 2022-05-12 Jasmine Quah , Omer Sella , Thomas Heinis

Synthetic DNA approaches 227.5 exabytes per gram of storage density with stability over millennial timescales. Realising this capacity requires error-correction codes that recover data from substantial synthesis and sequencing errors.…

Information Theory · Computer Science 2026-04-23 James L. Banal

DNA is an attractive medium for digital data storage. When data is stored on DNA, errors occur, which makes error-correcting coding techniques critical for reliable DNA data storage. To reduce the errors, a common technique is to include…

Information Theory · Computer Science 2024-06-27 Franziska Weindel , Andreas L. Gimpel , Robert N. Grass , Reinhard Heckel

Synthesis of DNA molecules offers unprecedented advances in storage technology. Yet, the microscopic world in which these molecules reside induces error patterns that are fundamentally different from their digital counterparts. Hence, to…

Information Theory · Computer Science 2017-08-08 Netanel Raviv , Moshe Schwartz , Eitan Yaakobi

In the emerging field of DNA storage, data is encoded as DNA sequences and stored. The data is read out again by sequencing the stored DNA. Nanopore sequencing is a new sequencing technology that has many advantages over other methods; in…

Information Theory · Computer Science 2021-02-04 Reyna Hulett , Shubham Chandak , Mary Wootters

We consider the maximum coding rate achievable by uniformly-random codes for the deletion channel. We prove an upper bound that's within 0.1 of the best known lower bounds for all values of the deletion probability $d,$ and much closer for…

Information Theory · Computer Science 2022-10-17 Berivan Isik , Francisco Pernice , Tsachy Weissman

Labeling of DNA molecules is a fundamental technique for DNA visualization and analysis. This process was mathematically modeled in [1], where the received sequence indicates the positions of the used labels. In this work, we develop error…

Information Theory · Computer Science 2025-11-04 Dganit Hanania , Eitan Yaakobi

In [1], the authors proposed a new model of DNA storage system that integrates all three steps of retrieval and introduced the concept of DNA-correcting codes, which guarantees that the output of the storage system can be decoded to the…

Information Theory · Computer Science 2023-11-17 Huawei Wu

The yearly global production of data is growing exponentially, outpacing the capacity of existing storage media, such as tape and disk, and surpassing our ability to store it. DNA storage - the representation of arbitrary information as…

Quantitative Methods · Quantitative Biology 2023-10-04 Thomas Heinis , Roman Sokolovskii , Jamie J. Alnasir

The coverage depth problem in DNA data storage is about minimizing the expected number of reads until all data is recovered. When they exist, MDS codes offer the best performance in this context. This paper focuses on the scenario where the…

Information Theory · Computer Science 2025-07-29 Matteo Bertuzzo , Alberto Ravagnani , Eitan Yaakobi

We study permutations over the set of $\ell$-grams, that are feasible in the sense that there is a sequence whose $\ell$-gram frequency has the same ranking as the permutation. Codes, which are sets of feasible permutations, protect…

Information Theory · Computer Science 2021-01-18 Niv Beeri , Moshe Schwartz

Although the expenses associated with DNA sequencing have been rapidly decreasing, the current cost of sequencing information stands at roughly $120/GB, which is dramatically more expensive than reading from existing archival storage…

Discrete Mathematics · Computer Science 2023-11-30 Daniella Bar-Lev , Omer Sabary , Ryan Gabrys , Eitan Yaakobi

Synthetic DNA can in principle be used for the archival storage of arbitrary data. Because errors are introduced during DNA synthesis, storage, and sequencing, an error-correcting code (ECC) is necessary for error-free recovery of the data.…

Quantitative Methods · Quantitative Biology 2018-12-05 William H. Press , John A. Hawkins

DNA storage has emerged as an important area of research. The reliability of DNA storage system depends on designing the DNA strings (called DNA codes) that are sufficiently dissimilar. In this work, we introduce DNA codes that satisfy a…

Information Theory · Computer Science 2022-11-28 Krishna Gopal Benerjee , Sourav Deb , Manish K Gupta

A new family of codes, called clustering-correcting codes, is presented in this paper. This family of codes is motivated by the special structure of data that is stored in DNA-based storage systems. The data stored in these systems has the…

Information Theory · Computer Science 2019-03-12 Tal Shinkar , Eitan Yaakobi , Andreas Lenz , Antonia Wachter-Zeh

Encoding information in combinations of pre-synthesised deoxyribonucleic acid (DNA) strands (referred to as motifs) is an interesting approach to DNA storage that could potentially circumvent the prohibitive costs of…

Information Theory · Computer Science 2024-12-05 Roman Sokolovskii , Parv Agarwal , Luis Alberto Croquevielle , Zijian Zhou , Thomas Heinis

DNA-based storage is an emerging technology that enables digital information to be archived in DNA molecules. This method enjoys major advantages over magnetic and optical storage solutions such as exceptional information density, enhanced…

Information Theory · Computer Science 2024-03-13 Daniella Bar-Lev , Itai Orr , Omer Sabary , Tuvi Etzion , Eitan Yaakobi

Due to its longevity and enormous information density, DNA is an attractive medium for archival storage. In this work, we study the fundamental limits and trade-offs of DNA-based storage systems by introducing a new channel model, which we…

Information Theory · Computer Science 2020-01-20 Ilan Shomorony , Reinhard Heckel

As DNA data storage moves closer to practical deployment, minimizing sequencing coverage depth is essential to reduce both operational costs and retrieval latency. This paper addresses the recently studied Random Access Problem, which…

Information Theory · Computer Science 2026-01-13 Chen Wang , Eitan Yaakobi