Metraipolis › archive › dc_f61fa9a35c14

The Coverage Depth Problem in Distributed DNA Data Storage — arXiv:2610.02931

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.02931
License (as archived)
CC0-1.0
Archived
2026-10-06T08:25:44.276Z
SHA-256 of the archived text
5c8aaaa2e67aff39a8949cad4cea4061568097205616914f0d1449b8abc54e86
Stable URL of this page
https://metraipolis.com/documento/dc_f61fa9a35c14

How to cite

The Coverage Depth Problem in Distributed DNA Data Storage — arXiv:2610.02931 — arXiv (en), https://arxiv.org/abs/2610.02931 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f61fa9a35c14 (Metraipolis archive dc_f61fa9a35c14, sha256 5c8aaaa2e67aff39a8949cad4cea4061568097205616914f0d1449b8abc54e86)
BibTeX
@misc{dcf61fa9a35c14,
  title = {The Coverage Depth Problem in Distributed DNA Data Storage — arXiv:2610.02931},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.02931},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f61fa9a35c14; sha256 5c8aaaa2e67aff39a8949cad4cea4061568097205616914f0d1449b8abc54e86},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.02931. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 independently sampled with replacement from each container per round. For arbitrary linear codes and ordered partitions, we derive exact formulas for the recovery-time distribution and expectation. We prove that MDS codes, whenever they exist, are optimal for every fixed partition, and establish a universal lower bound on the expected total read cost together with its equality conditions. For MDS codes, we identify container-size regimes that yield genuine savings in total reads and regimes that provide only parallelism without changing the asymptotic sequencing cost. For simplex codes, we prove that the $q$-ary simplex code is, up to isomorphism, the unique single-container minimizer among codes with the same parameters, resolving a recent conjecture by Bertuzzo, Ravagnani, and Yaakobi. We further construct a partition attaining the minimum total read cost and derive bounds for intermediate and balanced partitions. These results clarify when distributed sampling reduces latency alone and when it also reduces sequencing cost.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-05 in math.CO).
Categorie arXiv: Information Theory (cs.IT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.02931 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T08:18:48.327Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).