English
Related papers

Related papers: Efficiently Decodable Non-Adaptive Threshold Group…

200 papers

In this paper, we introduce a variation of the group testing problem where each test is specified by an ordered subset of items and returns the first defective item in the specified order or returns null if there are no defectives. We refer…

Information Theory · Computer Science 2024-09-30 Waqar Mirza , Nikhil Karamchandani , Niranjan Balachandran

In group testing, the task is to identify defective items by testing groups of them together using as few tests as possible. We consider the setting where each item is defective with a constant probability $\alpha$, independent of all other…

Discrete Mathematics · Computer Science 2024-11-15 Lukas Hintze , Lena Krieg , Olga Scheftelowitsch , Haodong Zhu

In probabilistic nonadaptive group testing (PGT), we aim to characterize the number of pooled tests necessary to identify a random $k$-sparse vector of defectives with high probability. Recent work has shown that $n$ tests are necessary…

Information Theory · Computer Science 2021-06-15 Larkin Flodin , Arya Mazumdar

The group testing problem consists of determining a sparse subset of defective items from within a larger set of items via a series of tests, where each test outcome indicates whether at least one defective item is included in the test. We…

Information Theory · Computer Science 2026-04-24 Daniel McMorrow , Jonathan Scarlett

The original problem of group testing consists in the identification of defective items in a collection, by applying tests on groups of items that detect the presence of at least one defective item in the group. The aim is then to identify…

Applications · Statistics 2021-06-10 Emilien Joly , Bastien Mallein

Group testing with inhibitors (GTI) introduced by Farach at al. is studied in this paper. There are three types of items, $d$ defectives, $r$ inhibitors and $n-d-r$ normal items in a population of $n$ items. The presence of any inhibitor in…

Information Theory · Computer Science 2014-12-16 Abhinav Ganesan , Javad Ebrahimi , Sidharth Jaggi , Venkatesh Saligrama

The goal of group testing is to efficiently identify a few specific items, called positives, in a large population of items via tests. A test is an action on a subset of items which returns positive if the subset contains at least one…

Information Theory · Computer Science 2021-11-08 Thach V. Bui , Mahdi Cheraghchi , An T. H. Nguyen , Thuc D. Nguyen

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 medical testing, communication protocols, pattern…

Information Theory · Computer Science 2020-01-27 Steffen Bondorf , Binbin Chen , Jonathan Scarlett , Haifeng Yu , Yuda Zhao

This article reviews a class of adaptive group testing procedures that operate under a probabilistic model assumption as follows. Consider a set of $N$ items, where item $i$ has the probability $p$ ($p_i$ in the generalized group testing)…

Methodology · Statistics 2021-02-19 Yaakov Malinovsky , Paul S. Albert

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 such as medical testing, communication protocols, pattern…

Information Theory · Computer Science 2023-09-19 Jonathan Scarlett , Oliver Johnson

In this paper, we derive mutual information based upper and lower bounds on the number of nonadaptive group tests required to identify a given number of "non defective" items from a large population containing a small number of "defective"…

Information Theory · Computer Science 2016-03-01 Abhay Sharma , Chandra R. Murthy

Let $1 \le s < t$, $N \ge 1$ be integers and a complex electronic circuit of size $t$ is said to be an $s$-active, $\; s \ll t$, and can work as a system block if not more than $s$ elements of the circuit are defective. Otherwise, the…

Information Theory · Computer Science 2016-01-26 A. G. D'yachkov , I. V. Vorobyev , N. A. Polyanskii , V. Yu. Shchukin

Group testing is a well known search problem that consists in detecting the defective members of a set of objects O by performing tests on properly chosen subsets (pools) of the given set O. In classical group testing the goal is to find…

Data Structures and Algorithms · Computer Science 2016-06-13 Annalisa De Bonis

The goal of combinatorial group testing is to efficiently identify up to $d$ defective items in a large population of $n$ items, where $d \ll n$. Defective items satisfy certain properties while the remaining items in the population do not.…

Information Theory · Computer Science 2019-04-02 Thach V. Bui , Minoru Kuribayashi , Mahdi Cheraghchi , Isao Echizen

We consider the nonadaptive group testing with N items, of which $K = \Theta(N^\theta)$ are defective. We study a test design in which each item appears in nearly the same number of tests. For each item, we independently pick L tests…

Information Theory · Computer Science 2018-09-26 Oliver Johnson , Matthew Aldridge , Jonathan Scarlett

In this paper, we consider the problem of noiseless non-adaptive probabilistic group testing, in which the goal is high-probability recovery of the defective set. We show that in the case of $n$ items among which $k$ are defective, the…

Information Theory · Computer Science 2021-07-30 Wei Heng Bay , Eric Price , Jonathan Scarlett

Identification of defective members of large populations has been widely studied in the statistics community under the name of group testing. It involves grouping subsets of items into different pools and detecting defective members based…

Information Theory · Computer Science 2016-11-18 Mahdi Cheraghchi , Ali Hormati , Amin Karbasi , Martin Vetterli

The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of tests, and is relevant in applications such as medical testing, communication protocols, pattern matching, and…

Information Theory · Computer Science 2019-01-30 Jonathan Scarlett , Volkan Cevher

In this paper, we introduce a variation of the group testing problem capturing the idea that a positive test requires a combination of multiple ``types'' of item. Specifically, we assume that there are multiple disjoint \emph{semi-defective…

Information Theory · Computer Science 2024-05-10 Thach V. Bui , Jonathan Scarlett

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$ items and $k$ defectives, we provide an algorithm attaining…

Information Theory · Computer Science 2020-06-19 Eric Price , Jonathan Scarlett