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

基于级联码的非自适应成组测试框架

Non-Adaptive Group Testing Framework based on Concatenation Code

Thach V. Bui, Minoru Kuribayashi, Isao Echizen

摘要:

我们考虑一个有效的可解码的非自适应组测试(NAGT)的问题,满足理论界。问题是尽快在大量的$N$项目中找到满足某些特征的几个特定项目(最多是$d$)。这些$d$特定项目称为\textit{defective items}。NAGT的思想是汇集一组项目,称为\textit{a test},然后对它们运行测试。如果测试结果是\textit{positive},则测试中至少存在一个缺陷项,如果是\textit{negative},则不存在缺陷项。形式上,二进制$t \times N$测量矩阵$\mathcal{M} = (m_{ij})$是$t$测试的表示,其中当且仅当项目$j$属于测试$i$时,行$i$代表测试$i$和$m_{ij} = 1$。NAGT有三个主要目标:最大限度地减少测试次数$t$,构建矩阵$\mathcal{M}$,以及尽快识别缺陷项。在本文中,我们提出了一个强显式的$\mathcal{M}$的建设时,有缺陷的项目的数量最多为2,测试的数量$t \simeq 16 \log{N} = O(\log{N})$。特别地,我们只需要$K \simeq N \times 16\log{N} = O(N\log{N})$比特来构造这样的矩阵,这是最优的。此外,给定这些$K$位,矩阵中的任何条目都可以在时间$O \left(\ln{N}/ \ln{\ln{N}} \right)$中构造。此外,可以在时间$O\left( \frac{\ln^2{N}}{\ln^2{\ln{N}}} \right)$上以高概率解码$\mathcal{M}$。当有缺陷的项目的数量大于2,我们提出了一个计划,可以识别至少$(1-ε)d$有缺陷的项目与$t \simeq 32 C(ε) d \log{N} = O(d \log{N})$在时间$O \left( d \frac{\ln^2{N}}{\ln^2{\ln{N}}} \right)$为任何接近零的$ε$,其中$C(ε)$是一个常数,只依赖于$ε$。

英文摘要:

We consider an efficiently decodable non-adaptive group testing (NAGT) problem that meets theoretical bounds. The problem is to find a few specific items (at most $d$) satisfying certain characteristics in a colossal number of $N$ items as quickly as possible. Those $d$ specific items are called \textit{defective items}. The idea of NAGT is to pool a group of items, which is called \textit{a test}, then run a test on them. If the test outcome is \textit{positive}, there exists at least one defective item in the test, and if it is \textit{negative}, there exists no defective items. Formally, a binary $t \times N$ measurement matrix $\mathcal{M} = (m_{ij})$ is the representation for $t$ tests where row $i$ stands for test $i$ and $m_{ij} = 1$ if and only if item $j$ belongs to test $i$. There are three main objectives in NAGT: minimize the number of tests $t$, construct matrix $\mathcal{M}$, and identify defective items as quickly as possible. In this paper, we present a strongly explicit construction of $\mathcal{M}$ for when the number of defective items is at most 2, with the number of tests $t \simeq 16 \log{N} = O(\log{N})$. In particular, we need only $K \simeq N \times 16\log{N} = O(N\log{N})$ bits to construct such matrices, which is optimal. Furthermore, given these $K$ bits, any entry in the matrix can be constructed in time $O \left(\ln{N}/ \ln{\ln{N}} \right)$. Moreover, $\mathcal{M}$ can be decoded with high probability in time $O\left( \frac{\ln^2{N}}{\ln^2{\ln{N}}} \right)$. When the number of defective items is greater than 2, we present a scheme that can identify at least $(1-ε)d$ defective items with $t \simeq 32 C(ε) d \log{N} = O(d \log{N})$ in time $O \left( d \frac{\ln^2{N}}{\ln^2{\ln{N}}} \right)$ for any close-to-zero $ε$, where $C(ε)$ is a constant that depends only on $ε$.

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

↑