The basic goal of threshold group testing is to identify up to d defective items among a population of n items (d≪n). The outcome of a test on a subset of the items is positive if the subset has at least u defective items, negative if it has up to ℓ defective items, where 0≤ ℓ < u, and arbitrary otherwise. There are a few reported studies on test designs and decoding algorithms for identifying defective items. Most of the approaches in previous studies have not been feasible, because their problems settings have numerous constraints or the decoding complexities of their proposed schemes are relatively large.This paper makes four contributions. The first is a corrected theorem for a non-adaptive algorithm proposed by Chen and Fu for threshold group testing. The second is an improvement in the construction of disjunct matrices, which are the main tools for tackling (threshold) group testing. Specifically, we present a better upper bound on the number of tests for disjunct matrices as compared to previous work. The last two contributions include a reduction in the number of tests and a reduction in the decoding time for deterministically identifying defective items in a noisy setting on test outcomes. A full version of this paper is accessible at: https://arxiv.org/abs/2001.01008.
展开▼
