We study deletion-correcting codes for an adversarial nanopore channel in which at most $t$ deletions may occur. We propose an explicit construction of $q$-ary codes of length $n$ for this channel with $2t\log_q n+Θ(\log\log n)$ redundant symbols. We also show that the optimal redundancy is between $t\log_q n+Ω(1)$ and $2t\log_q n-\log_q\log_2 n+O(1)$, so our explicit construction matches the existential upper bound to first order. In contrast, for the classical adversarial $q$-ary deletion channel, the smallest redundancy achieved by known explicit constructions that correct up to $t$ deletions is $4t(1+ε)\log_q n+o(\log n)$.

翻译：本文研究对抗性纳米孔通道的删除纠错码，该通道最多可能发生 $t$ 次删除。我们针对该通道提出一种显式构造的 $q$ 元码，码长为 $n$，冗余符号数为 $2t\log_q n+Θ(\log\log n)$。同时证明最优冗余介于 $t\log_q n+Ω(1)$ 与 $2t\log_q n-\log_q\log_2 n+O(1)$ 之间，因此我们的显式构造在一阶意义上达到了存在性上界。相比之下，对于经典的对抗性 $q$ 元删除通道，已知能纠正最多 $t$ 次删除的显式构造所实现的最小冗余为 $4t(1+ε)\log_q n+o(\log n)$。