English
Related papers

Related papers: On the Reliability of Information Retrieval From M…

200 papers

We initiate the study of DNA-based distributed storage systems, where information is encoded across multiple DNA data storage containers to achieve robustness against container failures. In this setting, data are distributed over $M$…

Information Theory · Computer Science 2026-02-10 Adi Levy , Roni Con , Eitan Yaakobi , Han Mao Kiah

DNA is emerging as an increasingly attractive medium for data storage due to a number of important and unique advantages it offers, most notably the unprecedented durability and density. While the technology is evolving rapidly, the…

Emerging Technologies · Computer Science 2022-05-03 Dehui Lin , Yasamin Tabatabaee , Yash Pote , Djordje Jevdjic

DNA, with remarkable properties of high density, durability, and replicability, is one of the most appealing storage media. Emerging DNA storage technologies use composite DNA letters, where information is represented by probability…

Information Theory · Computer Science 2025-03-26 Wenkai Zhang , Zhiying Wang

We consider error-correcting coding for deoxyribonucleic acid (DNA)-based storage using nanopore sequencing. We model the DNA storage channel as a sampling noise channel where the input data is chunked into $M$ short DNA strands, which are…

Information Theory · Computer Science 2024-06-21 Lorenz Welter , Roman Sokolovskii , Thomas Heinis , Antonia Wachter-Zeh , Eirik Rosnes , Alexandre Graell i Amat

The DNA storage channel is considered, in which a codeword is comprised of $M$ unordered DNA molecules. At reading time, $N$ molecules are sampled with replacement, and then each molecule is sequenced. A coded-index concatenated-coding…

Information Theory · Computer Science 2022-05-23 Nir Weinberger

We study the problem of coded information retrieval for block-structured data, motivated by DNA-based storage systems where a database is partitioned into multiple files that must each be recoverable as an atomic unit. We initiate and…

Information Theory · Computer Science 2026-03-19 Daniella Bar-Lev

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 the amount of reliable information that can be stored in a DNA-based storage system composed of short DNA molecules. In this regime, Shomorony and Heckel (2022) put forward a conjecture on the scaling of the number of information…

Information Theory · Computer Science 2025-11-19 Ran Tamir , Nir Weinberger , Albert Guillén i Fàbregas

DNA data storage systems encode digital data into DNA strands, enabling dense and durable storage. Efficient data retrieval depends on coverage depth, a key performance metric. We study the random access coverage depth problem and focus on…

Information Theory · Computer Science 2025-07-29 Şeyma Bodur , Stefano Lia , Hiram H. López , Rati Ludhani , Alberto Ravagnani , Lisa Seccia

Maximum-distance-separable (MDS) codes are a class of erasure codes that are widely adopted to enhance the reliability of distributed storage systems (DSS). In (n, k) MDS coded DSS, the original data are stored into n distributed nodes in…

Information Theory · Computer Science 2017-06-16 Sheng Guan , Haibin Kan , Xin Wang

We consider the design of regenerating codes for distributed storage systems that enjoy the property of local, exact and uncoded repair, i.e., (a) upon failure, a node can be regenerated by simply downloading packets from the surviving…

Information Theory · Computer Science 2013-05-27 Oktay Olmez , Aditya Ramamoorthy

We consider error-correcting coding for DNA-based storage. We model the DNA storage channel as a multi-draw IDS channel where the input data is chunked into $M$ short DNA strands, which are copied a random number of times, and the channel…

Information Theory · Computer Science 2023-06-22 Lorenz Welter , Issam Maarouf , Andreas Lenz , Antonia Wachter-Zeh , Eirik Rosnes , Alexandre Graell i Amat

In order to scale economically, data centers are increasingly evolving their data storage methods from the use of simple data replication to the use of more powerful erasure codes, which provide the same level of reliability as replication…

Information Theory · Computer Science 2013-11-12 Nihar B. Shah , Kangwook Lee , Kannan Ramchandran

In this paper, we study achievable rates of concatenated coding schemes over a deoxyribonucleic acid (DNA) storage channel. Our channel model incorporates the main features of DNA-based data storage. First, information is stored on many,…

Information Theory · Computer Science 2020-05-04 Andreas Lenz , Lorenz Welter , Sven Puchinger

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

DNA storage is now being considered as a new archival storage method for its durability and high information density, but still facing some challenges like high costs and low throughput. By reducing sequencing sample size for decoding…

Information Theory · Computer Science 2025-04-22 Ruiying Cao , Xin Chen

We study the amount of reliable information that can be stored in a DNA-based storage system with noisy sequencing, where each codeword is composed of short DNA molecules. We analyze a concatenated coding scheme, where the outer code is…

Information Theory · Computer Science 2026-05-19 Ran Tamir , Nir Weinberger , Albert Guillén i Fàbregas

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

Designing good error correcting codes whose generator matrix has a support constraint, i.e., one for which only certain entries of the generator matrix are allowed to be non-zero, has found many recent applications, including in distributed…

Information Theory · Computer Science 2018-01-25 Hikmet Yildiz , Babak Hassibi

We investigate the fundamental limits of the recently proposed random access coverage depth problem for DNA data storage. Under this paradigm, it is assumed that the user information consists of $k$ information strands, which are encoded…

Information Theory · Computer Science 2025-09-25 Anina Gruica , Daniella Bar-Lev , Alberto Ravagnani , Eitan Yaakobi
‹ Prev 1 2 3 10 Next ›