跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.25468 · v1

Improved Constants in the Kautz-Singleton Construction for Probabilistic Group Testing

首次提交 2026-11-19 11:55
版本更新 2026-11-19 11:55
雷达观测 2026-11-20 10:50
arXiv ↗PDF ↗

摘要

We consider the probabilistic nonadaptive group testing problem, in which a uniformly random defective set of size dd is to be identified among NN items using a binary test matrix. For the explicit Kautz--Singleton construction, it is known that order-optimal scaling T=Θ(dlog⁡N)T=Θ(d\log N) for high-probability recovery can be achieved in the regime d=Ω(log⁡2N)d=Ω(\log^2 N). However, the leading constant in this scaling remains uncharacterized even for standard low-complexity decoders. In this work, we revisit the probabilistic analysis of this construction and improve the leading constant for the COMP decoder, as well as establishing the same bound for the DD decoder. Our approach relies on a sharper analysis of the number of distinct roots associated with the defective items, yielding tighter bounds on the decoding error probability. In particular, we show that both COMP and DD achieve vanishing average error probability with T≤(1/ln⁡2+ε)dlog⁡NT\le (1/\ln 2+\varepsilon)d\log N tests for any ε>0\varepsilon>0, in the admissible regime N=qkN=q^k for some prime power q=Θ(d)q = Θ(d) and integer k≥2k \ge 2. For COMP, this leading constant matches that of the random near-constant column weight design, whereas for DD, a gap remains except in the sparse regime d=No(1)d = N^{o(1)}.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-19 11:55 · 最新观测版本

Improved Constants in the Kautz-Singleton Construction for Probabilistic Group Testing

We consider the probabilistic nonadaptive group testing problem, in which a uniformly random defective set of size dd is to be identified among NN items using a binary test matrix. For the explicit Kautz--Singleton construction, it is known that order-optimal scaling T=Θ(dlog⁡N)T=Θ(d\log N) for high-probability recovery can be achieved in the regime d=Ω(log⁡2N)d=Ω(\log^2 N). However, the leading constant in this scaling remains uncharacterized even for standard low-complexity decoders. In this work, we revisit the probabilistic analysis of this construction and improve the leading constant for the COMP decoder, as well as establishing the same bound for the DD decoder. Our approach relies on a sharper analysis of the number of distinct roots associated with the defective items, yielding tighter bounds on the decoding error probability. In particular, we show that both COMP and DD achieve vanishing average error probability with T≤(1/ln⁡2+ε)dlog⁡NT\le (1/\ln 2+\varepsilon)d\log N tests for any ε>0\varepsilon>0, in the admissible regime N=qkN=q^k for some prime power q=Θ(d)q = Θ(d) and integer k≥2k \ge 2. For COMP, this leading constant matches that of the random near-constant column weight design, whereas for DD, a gap remains except in the sparse regime d=No(1)d = N^{o(1)}.

查看此版本解读 →查看此版本原文 ↗