Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time
Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time
In the long-studied problem of combinatorial group testing, one is asked to detect a set of k defective items out of a population of size n, using m ≪ n disjunctive measurements. In the non-adaptive setting, the most widely used combinatorial objects are disjunct and list-disjunct matrices, which define incidence …