arXiv (All)
open access
The Coverage Depth Problem in Distributed DNA Data Storage
Random sampling in DNA sequencing produces repeated reads, increasing retrieval latency and sequencing cost. We study the coverage-depth problem for full-message recovery in distributed DNA storage under noiseless uniform sampling, where strands are partitioned among $M$ containers and one strand is
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning-Enhanced Composite DNA Data Storage Under Sampling Randomness and IDS Errors#986200
- Optimal Codes for the Coverage Depth Problem and the Performance of Random Codes#1216745
- Sequential Random Sampling PIR with Multiple Colluding Servers in DNA-Based Data Storage#1234578
- Learning-Enhanced Composite DNA Data Storage Under Sampling Randomness and IDS Errors#1079303
- Coding Schemes for the Noisy Torn Paper Channel#1108986
Record · ID 1187609
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive