Group testing: an information theory perspective
The group testing problem concerns discovering a small number of defective items within a
large population by performing tests on pools of items. A test is positive if the pool contains …
large population by performing tests on pools of items. A test is positive if the pool contains …
Performance of group testing algorithms with near-constant tests per item
We consider the nonadaptive group testing with N items, of which K= Θ (N θ) are defective.
We study a test design in which each item appears in nearly the same number of tests. For …
We study a test design in which each item appears in nearly the same number of tests. For …
Noisy adaptive group testing: Bounds and algorithms
J Scarlett - IEEE Transactions on Information Theory, 2018 - ieeexplore.ieee.org
The group testing problem consists of determining a small set of defective items from a
larger set of items based on a number of possibly noisy tests, and is relevant in applications …
larger set of items based on a number of possibly noisy tests, and is relevant in applications …
On the optimality of the Kautz-Singleton construction in probabilistic group testing
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 …
large population of N items are identified with high probability by applying binary tests. It is …
Efficient algorithms for noisy group testing
S Cai, M Jahangoshahi, M Bakshi… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Group-testing refers to the problem of identifying (with high probability) a (small) subset of D
defectives from a (large) set of N items via a “small” number of “pooled” tests (ie, tests that …
defectives from a (large) set of N items via a “small” number of “pooled” tests (ie, tests that …
Noisy non-adaptive group testing: A (near-) definite defectives approach
J Scarlett, O Johnson - IEEE Transactions on Information …, 2020 - ieeexplore.ieee.org
The group testing problem consists of determining a small set of defective items from a
larger set of items based on a number of possibly-noisy tests, and is relevant in applications …
larger set of items based on a number of possibly-noisy tests, and is relevant in applications …
Combinatorial group testing and sparse recovery schemes with near-optimal decoding time
M Cheraghchi, V Nakos - 2020 IEEE 61st Annual Symposium …, 2020 - ieeexplore.ieee.org
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 …
defective items out of a population of size n, using m≪ n disjunctive measurements. In the …
Nonadaptive group testing with random set of defectives
A Mazumdar - IEEE Transactions on Information Theory, 2016 - ieeexplore.ieee.org
In a group testing scheme, a series of tests are designed to identify a small number t of
defective items that are present among a large number N of items. Each test takes a group of …
defective items that are present among a large number N of items. Each test takes a group of …
A fast binary splitting approach to non-adaptive group testing
E Price, J Scarlett - arXiv preprint arXiv:2006.10268, 2020 - arxiv.org
In this paper, we consider the problem of noiseless non-adaptive group testing under the for-
each recovery guarantee, also known as probabilistic group testing. In the case of $ n …
each recovery guarantee, also known as probabilistic group testing. In the case of $ n …
Sublinear-Time Non-Adaptive Group Testing With O(k log n) Tests via Bit-Mixing Coding
The group testing problem consists of determining a small set of defective items from a
larger set of items based on tests on groups of items, and is relevant in applications such as …
larger set of items based on tests on groups of items, and is relevant in applications such as …