Fundamental limits of DNA storage systems
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“In 2017, Heckel et al. considered the storage capacity using both assembly methods and have shown that an index-based coding system is optimal for data storage purposes [31].”
From DNA Data Storage. (2023) · cites this paper as [31]
Citations
Cites
Next-Generation Digital Information Storage in DNA
Church, G. M., Gao, Y., & Kosuri, S. (2012) · Science · doi:10.1126/science.1226355 · Cited by 1,441 · cited 4×
“Several works [CGK12; Gol+13; Gra+15; Bor+16; EZ17; Yaz+15a] have demonstrated that writing, storing, and retrieving data on the order of megabytes is possible with today’s technology, and achieves information densities and information lifetimes [Gra+15] that are far beyond what state-of-the-art…”
BackgroundInfluentialTowards Practical, High-Capacity, Low-Maintenance Information Storage in Synthesized DNA
Goldman, N., Bertone, P., Chen, S., Dessimoz, C., LeProust, E. M., Sipos, B., & Birney, E. (2013) · Nature · doi:10.1038/nature11875 · Cited by 1,220
DNA Fountain enables a robust and efficient storage architecture
Erlich, Y., & Zielinski, D. (2017) · Science · doi:10.1126/science.aaj2038 · Cited by 898
Robust Chemical Preservation of Digital Information on DNA in Silica with Error-Correcting Codes
Grass, R. N., Heckel, R., Puddu, M., Paunescu, D., & Stark, W. J. (2015) · Angewandte Chemie International Edition · doi:10.1002/anie.201411378 · Cited by 754 · cited 1×
“Several works [2– 4, 6, 7, 13] have demonstrated that writing, storing, and retrieving data on the order of megabytes is possible with today’s technology, and achieves information densities and information lifetimes [7] that are far beyond what state-of-theart tapes and discs achieve.”
BackgroundSelf-citationA Rewritable, Random-Access DNA-Based Storage System
Tabatabaei Yazdi, S. M. H., Yuan, Y., Ma, J., Zhao, H., & Milenkovic, O. (2015) · Scientific Reports · doi:10.1038/srep14138 · Cited by 401
A DNA-Based Archival Storage System
Bornholt, J., Lopez, R., Carmean, D. M., Ceze, L., Seelig, G., & Strauss, K. (2016) · Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/2872362.2872397 · Cited by 316
DNA-Based Storage: Trends and Methods
Yazdi, S. M. H. T., Kiah, H. M., Garcia-Ruiz, E., Ma, J., Zhao, H., & Milenkovic, O. (2015) · IEEE Transactions on Molecular, Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2016.2537305 · Cited by 278 · cited 1×
“We refer to [4, 12] for a survey and an overview of the recent advances in the area.”
BackgroundBuilding an Associative Memory Vastly Larger Than the Brain
Baum, E. B. (1995) · Science · doi:10.1126/science.7725109 · Cited by 168 · cited 1×
“The idea to store information on DNA is relatively new [Bau95], and has recently gained significant attention [CGK12; Gol+13; Gra+15; Bor+16; EZ17; Yaz+15a], due to advances in synthesis and sequencing.”
BackgroundCodes for DNA Sequence Profiles
Kiah, H. M., Puleo, G. J., & Milenković, O. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2555321 · Cited by 145
Exact Reconstruction From Insertions in Synchronization Codes
Sala, F., Gabrys, R., Schoeny, C., & Dolecek, L. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2649493 · Cited by 92 · cited 1×
“Some of these aspects include DNA synthesis constraints such as sequence composition [4, 8, 13], the asymmetric nature of the DNA sequencing error channel [5], the need for codes that correct insertion errors [10], and the need for techniques to allow random access [13].”
Background
Research works printed but not linked: 3
- sayir, 2016, Codes for efficient data storage on DNA molecules, Talk at Inform Inference and Energy symposium Cambridge UK
- heckel, 2017, Fundamental Limits of DNA Storage Systems
- mackay, 2015, Near-capacity codes for fountainchannels with insertions, deletions, and substitutions, with applications to DNA archives, Unpublished manuscript
Cited by
Items 101–120 of 120
DP-DNA: A Digital Pattern-Aware DNA Storage System to Improve Encoding DensityPreprint
Li, B., Ou, L., & Du, D. H. C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.04123 · Cited by 2
“In the past, researchers investigated and demonstrated the feasibility of DNA storage [16,17,19,20,22,24,27,35,36,40, 45].”
BackgroundCascadable Stochastic Logic for DNA Storage
Solanki, A., Chen, T., & Riedel, M. D. (2021) · IEEE International Conference on Visual Communications and Image Processing (VCIP) · doi:10.1109/vcip53242.2021.9675433
Wang, Y. (2021) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/155241
Reconstruction of encoded data in DNA storage technology
Sankar, S. (2022) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/156818
DNA Archives: Revolutionizing Data Storage
Patel, R., Garg, D., Shah, M., Dharmajwala, S., Jindal, K., & Nayak, A. (2023) · International Conference on Innovative Mechanisms for Industry Applications · doi:10.1109/icimia60377.2023.10426397 · Cited by 1
“Heckel et al. [16] state that there has been a significant increase in the need for data storage due to the numerous issues caused by existing data centers and storage solutions.”
BackgroundDNA as a Storage Medium for Efficient and Reliable Cloud Data Archieving
Sriram.S, & Krithika, D. R. (2024) · International Journal of Advanced Research in Science Communication and Technology · doi:10.48175/ijetir-1218
Matrix recovery from permutations
Tsakiris, M. C. (2024) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2024.101688
On Permutation Capacity Regions of Multiple-Access Channels
Lu, W., & Makur, A. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619563
“Thirdly, high-density DNA storage systems encode data as unordered strings of nucleotides [18]–[22], and the task of randomly sampling short DNA fragments [23] is naturally described by a noisy shuffling channel [24].”
BackgroundExact Error Exponents for a Concatenated Coding Based Class of DNA Storage Codes
Ling, Y. H., & Scarlett, J. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619142
“…for how ( L, M, N ) scale with respect to one another, we will focus our attention on scaling regimes that are the most widely-adopted in information-theoretic studies (e.g., [4], [5], [11]), and are practically well-motivated (e.g., L = ⇥(log M ) corresponding to relatively short reads).”
BackgroundMethodDistributed coding with sorting and assignment
Debbache, S., & Benierbah, S. (2025) · Signal Image and Video Processing · doi:10.1007/s11760-025-04049-z
“When the permutation errors are introduced by the communication channel, we can only code multisets or need to use some kind of permutation channel correcting code [23, 28–31].”
Error Exponents for DNA Storage Codes With a Variable Number of Reads
Ling, Y. H., Weinberger, N., & Scarlett, J. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3590758
“…how ( L , M , N ) scale with respect to one another, we will focus our attention on scaling regimes that are the most widely-adopted in information-theoretic studies (e.g., [4], [5], [6], [12]), and are practically well-motivated (e.g., L = (cid:2)( log M ) corresponding to relatively short reads).”
Geno-Weaving: A Framework for Low-Complexity Capacity-Achieving DNA Data Storage
Wang, H.-P., & Guruswami, V. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3610643
“For instance, [33, Theorem 1] [36, Theorem 3] and [39, Theorem 4] provide equality; [35, Theorem 1] achieves the bound of [34, Theorem 1] [37, Theorem 1] achieves the capacity over binary erasure channels (BECs) with linear codes; [38, Theorem 5] achieves [38, Theorem 10] when β is large enough.”
InfluentialBounding the Capacity of the Multinomial Channel Using KL Divergence Covering and Packing
Tang, J. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195475 · Cited by 1
A New Lower Bound for Noisy Permutation Channels via Divergence Packing
Feng, L., Lv, G., Li, X., & Jin, Y. (2025) · Entropy · doi:10.3390/e27111101 · Cited by 1
“(b) DNA Storage Systems: The DNA storage systems, known for their high density and reliability over long periods, are another motivation for our research [14–16].”
Progressive decoding of DNA-stored JPEG data with on-the-fly error correctionPreprint
Nawaz, I., Agarwal, P., & Heinis, T. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.10.26.684640
“Synthesized oligos are also stored in an unstructured fashion, which necessitates the need for extra indexing information within the oligo [18] and increases erasures when sub-sampling from the oligo pool for sequencing & decoding [21].”
Coding Schemes for the Noisy Torn Paper Channel
Walter, F., Abu-Sini, M., Weinhardt, N., & Wachter-Zeh, A. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653626
“Details about the related channels are omitted due to lack of space.”
Model for InDels and Substitutions in Nanopore DNA Storage Based on Measured Data
Farkas, P., Farkašová, K., & Janvars, T. (2025) · International Conference on Electrical and Computer Engineering Researches (ICECER) · doi:10.1109/icecer65523.2025.11400833
“The most fundamental models were developed using Information theory tools [2-12] and used mostly in order to obtain bounds on capacity of the corresponding channels.”
Progressive Video Streaming from DNA Storage
Breach, F., Heinis, T., & Nawaz, I. (2025) · Picture Coding Symposium · doi:10.1109/pcs65673.2025.11417693
“Additionally, the process introduces strand-dependent errors, including insertions, deletions, and substitutions (IDS) [3].”
Impact of PCR Cycles and Mutation Rate on Linear DNA Barcode Detection
Font‐Segura, J. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11462641
Always-Aligned Half-Marker-Aided Soft Information Generation for DNA Data Storage
Zhang, Y., Yuan, Y., & Chen, W. (2026) · IEEE Communications Letters · doi:10.1109/lcomm.2026.3726284
“DNA data storage encodes and distributes digital information across numerous unordered strands [2], [3].”
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
- Semantic Scholar
- cf0d56fc56021a46bbea4fefcb4fbdc27bfc0baf
- 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.