arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1808.01457cs.ITmath.IT
收藏

概率群测验中Kautz-Singleton结构的最优性

On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing

Huseyin A. Inan, Peter Kairouz, Mary Wootters, Ayfer Ozgur

摘要:

我们考虑的概率组测试问题,其中$d$随机缺陷项目在一个大的人口$N$项目被确定为高概率应用二进制测试。当$d = O(N^α)$对某个$α\in (0, 1)$进行测试时,$Θ(d \log N)$测试对于恢复错误概率为零的缺陷集是必要且充分的.然而,据我们所知,一般来说,没有显式(确定性)构造实现$Θ(d \log N)$测试。在这项工作中,我们表明,一个著名的建设介绍Kautz和Singleton的组合组测试问题(这是已知的是次优的组合组测试的中等值$d$)实现了顺序最优$Θ(d \log N)$测试的概率组测试问题时,$d = Ω(\log^2 N)$。这提供了一个强显式的结构,实现了在概率组测试设置中对于$d$的大范围值的阶数最优结果。为了证明Kautz和Singleton的构造在概率环境中的顺序最优性,我们提供了一种新的分析,直接由随机缺陷集覆盖的非缺陷项的概率,而不是从底层代码的组合性质进行争论,这是文献中的主要方法。此外,我们使用递归技术转换成一个也可以有效地解码,只有一个对数-对数因子增加的测试数量的建设。

英文摘要:

We consider the probabilistic group testing problem where $d$ random defective items in a large population of $N$ items are identified with high probability by applying binary tests. It is known that $Θ(d \log N)$ tests are necessary and sufficient to recover the defective set with vanishing probability of error when $d = O(N^α)$ for some $α\in (0, 1)$. However, to the best of our knowledge, there is no explicit (deterministic) construction achieving $Θ(d \log N)$ tests in general. In this work, we show that a famous construction introduced by Kautz and Singleton for the combinatorial group testing problem (which is known to be suboptimal for combinatorial group testing for moderate values of $d$) achieves the order optimal $Θ(d \log N)$ tests in the probabilistic group testing problem when $d = Ω(\log^2 N)$. This provides a strongly explicit construction achieving the order optimal result in the probabilistic group testing setting for a wide range of values of $d$. To prove the order-optimality of Kautz and Singleton's construction in the probabilistic setting, we provide a novel analysis of the probability of a non-defective item being covered by a random defective set directly, rather than arguing from combinatorial properties of the underlying code, which has been the main approach in the literature. Furthermore, we use a recursive technique to convert this construction into one that can also be efficiently decoded with only a log-log factor increase in the number of tests.

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

↑