Derives sharp phase transition at c_inf^TGT k log(n/k) tests for threshold group testing on constant-column designs, with c depending on prevalence and threshold; same as CGT at low prevalence but reduction at higher, and strictly harder when defective proportion is positive.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Develops a spatially coupled inference algorithm for threshold group testing that achieves exact recovery at the information-theoretic threshold with a simpler proof than prior methods.
citing papers explorer
-
An Information-Theoretic Analysis of Threshold Group Testing
Derives sharp phase transition at c_inf^TGT k log(n/k) tests for threshold group testing on constant-column designs, with c depending on prevalence and threshold; same as CGT at low prevalence but reduction at higher, and strictly harder when defective proportion is positive.
-
Algorithms for Threshold Group Testing
Develops a spatially coupled inference algorithm for threshold group testing that achieves exact recovery at the information-theoretic threshold with a simpler proof than prior methods.