arXiv (All)
open access
Optimal Codes for the Coverage Depth Problem and the Performance of Random Codes
DNA storage systems retrieve information by randomly sampling synthesized DNA strands, making the number of reads required for successful recovery a fundamental performance measure. This motivates the coverage depth problem: for given code parameters, determine a linear code that minimizes the expec
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
- The Coverage Depth Problem in Distributed DNA Data Storage#1187609
- Learning-Enhanced Composite DNA Data Storage Under Sampling Randomness and IDS Errors#986200
- A Hyperbolic Bound for File Retrieval in DNA-Based Data Storage#1130909
- Learning-Enhanced Composite DNA Data Storage Under Sampling Randomness and IDS Errors#1079303
- Regenerating codes with minimal disk I/O cost achieving optimal tradeoff between storage and repair bandwidth#629896
Record · ID 1216745
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