English
Related papers

Related papers: Threshold Disjunctive Codes

200 papers

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-07-05 A. G. D'yachkov , I. V. Vorobyev , N. A. Polyanskii , V. Yu. Shchukin

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

Union-free codes and disjunctive codes are two combinatorial structures, which are used in nonadaptive group testing to find a set of $d$ defective elements among $n$ samples by carrying out the minimal number of tests $t$. It is known that…

Information Theory · Computer Science 2022-01-13 Ilya Vorobyev

We consider non-adaptive threshold group testing for identification of up to $d$ defective items in a set of $n$ items, where a test is positive if it contains at least $2 \leq u \leq d$ defective items, and negative otherwise. The…

Information Theory · Computer Science 2018-09-25 Thach V. Bui , Minoru Kuribayashi , Mahdi Cheraghchi , Isao Echizen

In group testing, simple binary-output tests are designed to identify a small number $t$ of defective items that are present in a large population of $N$ items. Each test takes as input a group of items and produces a binary output…

Information Theory · Computer Science 2017-04-11 Alexander Barg , Arya Mazumdar

A binary code is said to be a disjunctive list-decoding $s_L$-code, $s\ge1$, $L\ge1$, (briefly, LD $s_L$-code) if the code is identified by the incidence matrix of a family of finite sets in which the union of any $s$ sets can cover not…

Information Theory · Computer Science 2014-07-10 A. G. Dyachkov , I. V. Vorobyev , N. A. Polyanskii , V. Yu. Shchukin

In a group testing scheme, a set of tests is designed to identify a small number $t$ of defective items that are present among a large number $N$ of items. Each test takes as input a group of items and produces a binary output indicating…

Information Theory · Computer Science 2016-11-17 Arya Mazumdar

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

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 \ll n$ disjunctive measurements. In the non-adaptive setting, the most widely used…

Information Theory · Computer Science 2020-09-28 Mahdi Cheraghchi , Vasileios Nakos

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

We formulate and analyze a stochastic threshold group testing problem motivated by biological applications. Here a set of $n$ items contains a subset of $d \ll n$ defective items. Subsets (pools) of the $n$ items are tested -- the test…

Information Theory · Computer Science 2013-04-25 Chun Lam Chan , Sheng Cai , Mayank Bakshi , Sidharth Jaggi , Venkatesh Saligrama

A binary code is said to be a disjunctive list-decoding $s_L$-code (LD $s_L$-code), $s \ge 2$, $L \ge 1$, if the code is identified by the incidence matrix of a family of finite sets in which the union (or disjunctive sum) of any $s$ sets…

Information Theory · Computer Science 2015-03-31 Arkadii D'yachkov , Ilya Vorobyev , Nikita Polyanskii , Vladislav Shchukin

The 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$. A test is positive if it has at least $u$ defective items and negative otherwise. Our…

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

Given $d$ defective items in a population of $n$ items with $d \ll n$, in threshold group testing without gap, the outcome of a test on a subset of items is positive if the subset has at least $u$ defective items and negative otherwise,…

Information Theory · Computer Science 2024-05-10 Thach V. Bui , Yeow Meng Chee , Van Khu Vu

Let $X$ be a set of items of size $n$ , which may contain some defective items denoted by $I$, where $I \subseteq X$. In group testing, a {\it test} refers to a subset of items $Q \subset X$. The test outcome is $1$ (positive) if $Q$…

Data Structures and Algorithms · Computer Science 2023-09-19 Nader H. Bshouty , Gergely Harcos

This paper considers the problem of Quantitative Group Testing (QGT) where there are some defective items among a large population of $N$ items. We consider the scenario in which each item is defective with probability $K/N$, independently…

Information Theory · Computer Science 2019-10-16 Esmaeil Karimi , Fatemeh Kazemi , Anoosheh Heidarzadeh , Krishna R. Narayanan , Alex Sprintson

Group testing is an approach aimed at identifying up to $d$ defective items among a total of $n$ elements. This is accomplished by examining subsets to determine if at least one defective item is present. In our study, we focus on the…

Data Structures and Algorithms · Computer Science 2023-07-12 Nader H. Bshouty , Catherine A. Haddad-Zaknoon

PCR testing is an invaluable diagnostic tool that has most recently seen widespread use during the COVID-19 pandemic. A recent work by Wang, Gabrys and Vardy proposed tropical codes as a model for group PCR testing. For a known but…

Information Theory · Computer Science 2023-05-10 Nicholas Kwan , Lele Wang

We study the problem of group testing with a non-adaptive randomized algorithm in the random incidence design (RID) model where each entry in the test is chosen randomly independently from $\{0,1\}$ with a fixed probability $p$. The…

Machine Learning · Computer Science 2017-08-10 Nader H. Bshouty , Nuha Diab , Shada R. Kawar , Robert J. Shahla

Given $n$ items with at most $d$ of which being positive, instead of testing these items individually, the theory of combinatorial group testing aims to identify all positive items using as few tests as possible. This paper is devoted to a…

Information Theory · Computer Science 2016-10-26 Chong Shangguan , Gennian Ge
‹ Prev 1 2 3 10 Next ›