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

有序复合DNA序列码的界限与构造

Bounds and Constructions of Codes for Ordered Composite DNA Sequences

Institute of Mathematics and Interdisciplinary Sciences, Xidian University(西安电子科技大学数学与 interdisciplinary 科学学院);School of Mathematical Sciences, Capital Normal University(首都师范大学数学科学学院)

Zuo Ye, Yuling Li, Zhaojun Lan, Gennian Ge

AI总结:

本文研究了有序复合DNA序列码的界限与构造,提出了一系列具有高效编码器的码,并改进了现有构造方法。

摘要:

本文扩展了Dollma等人关于有序复合DNA序列码的基础工作。我们考虑一个大小为q的字母表和一个分辨参数k的通用设置,超越了之前主要研究的二进制(q=2)情况。我们研究了在几种信道模型下纠错码的纠错能力,包括(e₁,…,e_k)-复合误差/删除、e-复合误差/删除以及新引入的t-(e₁,…,e_t)-复合误差/删除模型。我们首先建立了复合误差纠错码(CECCs)和复合删除纠错码(CDCCs)家族之间的等价关系,这显著减少了需要单独分析的不同误差参数集的数量。然后我们通过改进的球面填充论证和概率方法推导了CECCs大小的新型和通用上界。这些上界覆盖了所有参数q、k、(e₁,…,e_k)和e的值。相比之下,之前的上界仅针对q=2和有限的k、(e₁,…,e_k)和e的选择。对于CDCCs,我们推广了已知的非渐进行为上界对于(1,0,…,0)-CDCCs,并随后提供了更清晰的渐进行为上界。在构造方面,对于任何q≥2,我们提出了(1,0,…,0)-CDCCs、1-CDCCs和t-(1,…,1)-CDCCs,具有接近最优的冗余度。这些码具有高效的系统编码器。对于替换误差,我们为二进制(1,0,…,0)-CECC设计了第一个显式编码和解码算法,由Dollma等人构造,然后将该方法扩展到一般q。此外,我们给出了改进的二进制1-CECCs构造,非二进制1-CECCs的构造,以及t-(1,…,1)-CECCs的构造。这些构造也是系统化的。

英文摘要:

This paper extends the foundational work of Dollma \emph{et al}. on codes for ordered composite DNA sequences. We consider the general setting with an alphabet of size $q$ and a resolution parameter $k$, moving beyond the binary ($q=2$) case primarily studied previously. We investigate error-correcting codes for substitution errors and deletion errors under several channel models, including $(e_1,\ldots,e_k)$-composite error/deletion, $e$-composite error/deletion, and the newly introduced $t$-$(e_1,\ldots,e_t)$-composite error/deletion model. We first establish equivalence relations among families of composite-error correcting codes (CECCs) and among families of composite-deletion correcting codes (CDCCs). This significantly reduces the number of distinct error-parameter sets that require separate analysis. We then derive novel and general upper bounds on the sizes of CECCs using refined sphere-packing arguments and probabilistic methods. These bounds together cover all values of parameters $q$, $k$, $(e_1,\ldots,e_k)$ and $e$. In contrast, previous bounds were only established for $q=2$ and limited choices of $k$, $(e_1,\ldots,e_k)$ and $e$. For CDCCs, we generalize a known non-asymptotic upper bound for $(1,0,\ldots,0)$-CDCCs and then provide a cleaner asymptotic bound. On the constructive side, for any $q\ge2$, we propose $(1,0,\ldots,0)$-CDCCs, $1$-CDCCs and $t$-$(1,\ldots,1)$-CDCCs with near-optimal redundancies. These codes have efficient and systematic encoders. For substitution errors, we design the first explicit encoding and decoding algorithms for the binary $(1,0,\ldots,0)$-CECC constructed by Dollma \emph{et al}, and extend the approach to general $q$. Furthermore, we give an improved construction of binary $1$-CECCs, a construction of nonbinary $1$-CECCs, and a construction of $t$-$(1,\ldots,1)$-CECCs. These constructions are also systematic.

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

↑