arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.17154cs.ITmath.COmath.IT
收藏

编码信息检索用于块结构的DNA基础数据存储

Coded Information Retrieval for Block-Structured DNA-Based Data Storage

Universität Zürich(苏黎世大学)

Daniella Bar-Lev

AI总结:

本文研究了块结构数据的编码信息检索问题,针对DNA存储系统中数据库分块需单独恢复的情况,提出了块结构检索问题,推导了线性下界和非线性几何界,并分析了不同编码方案的检索时间。

摘要:

我们研究了块结构数据的编码信息检索问题,受DNA存储系统启发,数据库被划分为多个文件,每个文件必须单独恢复。我们正式提出了块结构检索问题,其中k个信息符号被划分为两个文件F1和F2,大小分别为s1和s2=k-s1。目标是表征所有[n,k]线性码的生成矩阵G下的可实现预期检索时间对(E1(G),E2(G))。我们通过恢复集的互斥性推导了线性下界,通过列投影发展了非线性几何界。对于无混合列的码,这产生超几何约束s1/E1 + s2/E2 ≤ 1,我们推测当max{s1,s2}≥2时普遍成立。我们分析了显式码,如身份码、文件专用MDS码和系统全局MDS码,并计算了它们的预期检索时间。对于文件专用码,我们证明了MDS最优性并验证了超几何约束。对于全局MDS码,我们通过组合子集计数论证证明了比例局部MDS分配的主导性,提供了比近期文献更简单的证明,并将结果扩展到非对称情况。最后,我们表征了n→∞时的极限可实现区域:超几何边界由文件专用MDS码渐近达到,且推测是极限可实现区域的确切边界。

英文摘要:

We study the problem of coded information retrieval for block-structured data, motivated by DNA-based storage systems where a database is partitioned into multiple files that must each be recoverable as an atomic unit. We initiate and formalize the block-structured retrieval problem, wherein $k$ information symbols are partitioned into two files $F_1$ and $F_2$ of sizes $s_1$ and $s_2 = k - s_1$. The objective is to characterize the set of achievable expected retrieval time pairs $\bigl(E_1(G), E_2(G)\bigr)$ over all $[n,k]$ linear codes with generator matrix $G$. We derive a family of linear lower bounds via mutual exclusivity of recovery sets and develop a nonlinear geometric bound via column projection that holds for every linear code. For codes with no mixed columns, this yields the hyperbolic constraint $s_1/E_1 + s_2/E_2 \le 1$, which we conjecture to hold universally whenever $\max\{s_1,s_2\} \ge 2$. We analyze explicit codes, such as the identity code, file-dedicated MDS codes, and the systematic global MDS code, and compute their exact expected retrieval times. For file-dedicated codes, we prove MDS optimality within the family and verify the hyperbolic constraint. For global MDS codes, we establish dominance by the proportional local MDS allocation via a convex-ordering argument for hypergeometric distributions, simplifying and extending prior work to the asymmetric case. Finally, we characterize the limiting achievability region as $n \to \infty$: the hyperbolic boundary is asymptotically achieved by file-dedicated MDS codes, and is conjectured to be the exact boundary of the limiting achievability region.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑