English
Related papers

Related papers: Group testing schemes from codes and designs

200 papers

The conventional model of disjunctive group testing assumes that there are several defective elements (or defectives) among a large population, and a group test yields the positive response if and only if the testing group contains at least…

Information Theory · Computer Science 2019-08-20 A. G. D'yachkov , N. A. Polyanskii , V. Yu. Shchukin , I. V. Vorobyev

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

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 nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

Combinatorics · Mathematics 2021-10-15 Bingchen Qian , Xin Wang , Gennian Ge

We consider adaptive group testing in the linear regime, where the number of defective items scales linearly with the number of items. We analyse an algorithm based on generalized binary splitting. Provided fewer than half the items are…

Information Theory · Computer Science 2020-04-07 Matthew Aldridge

In the classical combinatorial (adaptive) group testing problem, one is given two integers \(d\) and \(n\), where \(0\le d\le n\), and a population of \(n\) items, exactly \(d\) of which are known to be defective. The question is to devise…

Combinatorics · Mathematics 2014-07-24 David Cariolaro , Zhaiming Shen , Yi Zhang

The rapid development of derandomization theory, which is a fundamental area in theoretical computer science, has recently led to many surprising applications outside its initial intention. We will review some recent such developments…

Information Theory · Computer Science 2015-03-17 Mahdi Cheraghchi

In the context of fault-detection problems, the objective is to identify all defective items among a set of $n$ binary-state items using the minimum number of tests. The {group testing} paradigm, which allows testing a subset of items in a…

Combinatorics · Mathematics 2025-11-18 Jun Wu , Yongxi Cheng , Zhen Yang , Feng Chu , Junkai He

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 at least one defective, and negative if it contains no…

Information Theory · Computer Science 2026-05-15 Matthew Aldridge , Oliver Johnson , Jonathan Scarlett

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

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

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

The basic goal of threshold group testing is to identify up to $d$ defective items among a population of $n$ items, where $d$ is usually much smaller than $n$. The outcome of a test on a subset of items is positive if the subset has at…

Information Theory · Computer Science 2021-08-24 Thach V. Bui , Mahdi Cheraghchi , Isao Echizen

This paper proposes a novel generalization of group testing, called multi-group testing, which relaxes the notion of "testing subset" in group testing to "testing multi-set". The generalization aims to learn more information of each item to…

Information Theory · Computer Science 2014-12-18 Fei-Huang Chang , Hong-Bin Chen , Jun-Yi Guo , Yu-Pei Huang

In the problem of classical group testing one aims to identify a small subset (of size $d$) diseased individuals/defective items in a large population (of size $n$). This process is based on a minimal number of suitably-designed group tests…

Information Theory · Computer Science 2022-09-26 Xiwei Cheng , Sidharth Jaggi , Qiaoqiao Zhou

Group testing is the process of pooling arbitrary subsets from a set of $n$ items so as to identify, with a minimal number of tests, a "small" subset of $d$ defective items. In "classical" non-adaptive group testing, it is known that when…

Information Theory · Computer Science 2018-09-21 Venkata Gandikota , Elena Grigorescu , Sidharth Jaggi , Samson Zhou

In this paper we study a new, generalized version of the well-known group testing problem. In the classical model of group testing we are given n objects, some of which are considered to be defective. We can test certain subsets of the…

Combinatorics · Mathematics 2012-04-09 Dániel Gerbner , Balázs Keszegh , Dömötör Pálvölgyi , Gábor Wiener

In the group testing problem, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether any defective item is present. This problem is relevant in areas such as medical…

Information Theory · Computer Science 2022-09-28 Nelvin Tan , Way Tan , Jonathan Scarlett

We consider the problem of non-adaptive group testing of $N$ items out of which $K$ or less items are known to be defective. We propose a testing scheme based on left-and-right-regular sparse-graph codes and a simple iterative decoder. We…

Information Theory · Computer Science 2017-01-27 Avinash Vem , Nagaraj T. Janakiraman , Krishna R. Narayanan

The goal of non-adaptive group testing is to identify at most $d$ defective items from $N$ items, in which a test of a subset of $N$ items is positive if it contains at least one defective item, and negative otherwise. However, in many…

Information Theory · Computer Science 2018-03-19 Thach V. Bui , Tetsuya Kojima , Minoru Kuribayashi , Isao Echizen