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

Hamming度量下$\ell$-读码的界与构造

Bounds and Constructions of $\ell$-Read Codes under the Hamming Metric

Yubo Sun, Gennian Ge

AI总结:

本文研究Hamming度量下$\ell$-读码的界与构造,改进已有结果,给出$2$-读码在最小距离3、4、5时的最优冗余度,并建立与经典重建码的等价关系。

摘要:

纳米孔测序是一种有前景的DNA测序技术。在本文中,我们研究纳米孔测序仪的一种特定模型,该模型以长度为$n$的$q$元序列作为输入,并输出长度为$n+\ell-1$的向量,称为$\ell$-读向量,其中第$i$个条目是一个多重集,由输入序列第$(i-\ell+1)$到第$i$个位置之间的$\ell$个元素组成。考虑到输出向量中可能存在替换错误,我们研究Hamming度量下的$\ell$-读码。一个$\ell$-读$(n,d)_q$-码是一组长度为$n$的$q$元序列的集合,其中任意两个不同序列的$\ell$-读向量之间的Hamming距离至少为$d$。我们首先改进了Banerjee等人的结果,他们研究了约束条件为$\ell\geq 3$和$d=3$的$\ell$-读$(n,d)_q$-码。然后,我们分别研究了最小距离为$3$、$4$和$5$的$2$-读码的界和构造。我们的结果表明,当$d \in \{3,4\}$时,$2$-读$(n,d)_q$-码的最优冗余度为$o(\log_q n)$,而当$d=5$时,最优冗余度为$\log_q n+o(\log_q n)$。此外,我们建立了$2$-读$(n,3)_q$-码与使用两次噪声读的经典$q$元单插入重建码之间的等价性。我们改进了使用两次噪声读时经典$q$元单插入重建码冗余度的下界,以及经典$q$元单删除重建码冗余度的上界。最后,我们研究了重建模型下的$\ell$-读码。

英文摘要:

Nanopore sequencing is a promising technology for DNA sequencing. In this paper, we investigate a specific model of the nanopore sequencer, which takes a $q$-ary sequence of length $n$ as input and outputs a vector of length $n+\ell-1$ referred to as an $\ell$-read vector where the $i$-th entry is a multi-set composed of the $\ell$ elements located between the $(i-\ell+1)$-th and $i$-th positions of the input sequence. Considering the presence of substitution errors in the output vector, we study $\ell$-read codes under the Hamming metric. An $\ell$-read $(n,d)_q$-code is a set of $q$-ary sequences of length $n$ in which the Hamming distance between $\ell$-read vectors of any two distinct sequences is at least $d$. We first improve the result of Banerjee \emph{et al.}, who studied $\ell$-read $(n,d)_q$-codes with the constraint $\ell\geq 3$ and $d=3$. Then, we investigate the bounds and constructions of $2$-read codes with a minimum distance of $3$, $4$, and $5$, respectively. Our results indicate that when $d \in \{3,4\}$, the optimal redundancy of $2$-read $(n,d)_q$-codes is $o(\log_q n)$, while for $d=5$ it is $\log_q n+o(\log_q n)$. Additionally, we establish an equivalence between $2$-read $(n,3)_q$-codes and classical $q$-ary single-insertion reconstruction codes using two noisy reads. We improve the lower bound on the redundancy of classical $q$-ary single-insertion reconstruction codes as well as the upper bound on the redundancy of classical $q$-ary single-deletion reconstruction codes when using two noisy reads. Finally, we study $\ell$-read codes under the reconstruction model.

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

↑