跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+479新增论文
+361其中 AI 相关
+63已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 13:44各信源进度 →

统计口径与数据新鲜度

统计 2026-11-15 16:59 — 2026-11-16 16:59(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 13:44库内论文最新更新时间:2026-11-14 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,827 已收录论文19,941 AI 相关6,921 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
新论文 · v1arXiv:2611.13434

Minimum Synthesis Time for Single-Deletion Correcting Codes of Prescribed Size

Yuling Li, Wenjun Yu, Gennian Ge

原文摘要

DNA is a promising medium for data storage, but the high cost of DNA synthesis remains a major obstacle to its widespread deployment. In the reference-based synthesis model, synthesis time is measured by the length of the reference sequence. Previous studies have analyzed code sizes under synthesis-time constraints and constructed cost-constrained codes, including codes that correct deletions. In this paper, we study the minimum synthesis time for codes of prescribed size, considering both unrestricted codes and single-deletion correcting codes. We establish finite-length lower bounds valid for arbitrary reference sequences and upper bounds using existing $q$-ary differential VT codes. For fixed $q\geq3$, $A>0$, and $R\in(0,1)$, we determine the minimum synthesis time up to an $O(1)$ term when the code size is $M_n=\lfloor Aq^{Rn}\rfloor$. The corresponding redundancy is $(1-R)n\log_2q-\log_2A+o(1)$ bits. In particular, for these code sizes, the minimum synthesis time for single-deletion correcting codes exceeds that for unrestricted codes by a term proportional to $\ln n$, and we determine its coefficient. We also derive upper and lower bounds for code sizes $\lfloor q^n/(nq^{s_n})\rfloor$, where $s_n\to\infty$ and $s_n=o(n)$. These sizes correspond to redundancy $\log_2 n+s_n\log_2q+o(1)$ bits. For code sizes $\lfloor q^n/(nq^c)\rfloor$ with fixed constant $c$, the redundancy is $\log_2 n+c\log_2q+o(1)$ bits. We give conditions under which single-deletion correcting codes exist or do not exist for all sufficiently large $n$, together with bounds on the minimum synthesis time. These results show how code size and the single-deletion correcting constraint affect synthesis time and provide theoretical guidance for the construction of cost-constrained codes.

cs.IT