Information-Theoretic Foundations of DNA Data Storage

DOI10.1561/0100000117OpenAlexW4213456065MaRDI QIDQ5863762

Reinhard Heckel, Ilan Shomorony

Publication date: 3 June 2022

Published in: Foundations and Trends® in Communications and Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1561/0100000117

zbMATH Keywords

Shannon theoryinformation theory and computer sciencecoding theory and practicestorage and recording codes

Mathematics Subject Classification ID

Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24) Theory of data (68Pxx)

Uses Software

• MUSCLE
• GitHub
• SOLQC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstruction of objects from a minimum number of distorted patterns
• Subpolynomial trace reconstruction for random strings and arbitrary deletion probability
• New lower bounds for trace reconstruction
• Codes for DNA Sequence Profiles
• A Simple Lower Bound for the Capacity of the Deletion Channel
• Optimal coding strategies for certain permuting channels
• Bounds on the capacity of a spectrally constrained Poisson channel
• Models and information-theoretic bounds for nanopore sequencing
• Efficient Low-Redundancy Codes for Correcting Multiple Deletions
• Codes Correcting Two Deletions
• Codes in the Space of Multisets—Coding for Permutation Channels With Impairments
• On the Capacity of the Discrete-Time Poisson Channel
• Synchronization strings
• Trace reconstruction with exp(O(n ^1/3 )) samples
• Optimal mean-based algorithms for trace reconstruction
• Synchronization Strings and Codes for Insertions and Deletions—A Survey
• On Optimal k-Deletion Correcting Codes
• DNA-Based Storage: Models and Fundamental Limits
• Explicit Two-Deletion Codes With Redundancy Matching the Existential Bound
• Coding Over Sets for DNA Storage
• Sequence-Subset Distance and Coding for Error Control in DNA-Based Data Storage
• Coded Trace Reconstruction
• The Bee-Identification Error Exponent With Absentee Bees
• Trace reconstruction with varying deletion probabilities
• Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels
• Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis
• Capacity Upper Bounds for Deletion-type Channels
• The Discrete-Time Poisson Channel at Low Input Powers
• Exact Reconstruction From Insertions in Synchronization Codes
• Optimal Coding for the Binary Deletion Channel With Small Deletion Probability
• Information Theory of DNA Shotgun Sequencing
• String Reconstruction from Substring Compositions

This page was built for publication: Information-Theoretic Foundations of DNA Data Storage