CoChat

Fundamental limits of DNA storage systems

Heckel, Reinhard, Shomorony, Ilan, Ramchandran, Kannan, Tse, David N. C. · 2017 · 2017 IEEE International Symposium on Information Theory (ISIT)

The DOI matches its Crossref record; 11 of the 12 references it cites were found in a registry or an index.

Abstract

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 tradeoffs of DNA-based storage systems under a simple model, motivated by current technological constraints on DNA synthesis and sequencing. Our model captures two key distinctive aspects of DNA storage systems: (1) the data is written onto many short DNA molecules that are stored in an unordered way and (2) the data is read by randomly sampling from this DNA pool. Under this model, we characterize the storage capacity, and show that a simple index-based coding scheme is optimal.

Overview

Integrity signals

Registry

Crossref · 10.1109/isit.2017.8007106

Cites

11 of 11 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Research works printed but not linked: 3

  1. sayir, 2016, Codes for efficient data storage on DNA molecules, Talk at Inform Inference and Energy symposium Cambridge UK
  2. heckel, 2017, Fundamental Limits of DNA Storage Systems
  3. mackay, 2015, Near-capacity codes for fountainchannels with insertions, deletions, and substitutions, with applications to DNA archives, Unpublished manuscript

Cited by

See all 123

Metadata

Authors
Heckel, R., Shomorony, I., Ramchandran, K., & Tse, D. N. C.
Affiliations
  • University of California, Berkeley (US)
  • Stanford University (US)
Venue
2017 IEEE International Symposium on Information Theory (ISIT)
Publisher
IEEE
Published
2017-06
Pages
3130-3134
OpenAlex
W2615068531
Cited by
123
References
12
Citations by year
2026: 4 · 2025: 17 · 2024: 11 · 2023: 16 · 2022: 15 · 2021: 19 · 2020: 17 · 2019: 17 · 2018: 5 · 2017: 2
FWCI
41.67
Type
conference paper
Language
en
Open access
closed
Locations
IEEE International Symposium on Information Theory (ISIT) (publishedVersion)
Funders
National Science Foundation
Topics
  • Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
  • Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
  • Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Data Storage Technologies
Keywords
DNA data storage, fundamental limits, storage capacity, random sampling, archival storage, information density

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.