Efficient (Nonrandom) construction and decoding for non-adaptive group testing

Document Type

Article

Publication Date

1-1-2019

Abstract

The task of non-adaptive group testing is to identify up to d defective items from N items, where a test is positive if it contains at least one defective item, and negative otherwise. If there are t tests, they can be represented as a t × N measurement matrix. We have answered the question of whether there exists a scheme such that a larger measurement matrix, built from a given t × N measurement matrix, can be used to identify up to d defective items in) time O(t log 2 N). In the meantime, a t × N nonrandom measurement matrix with (forumala presented). can be obtained to identify up to d defective items in time poly(t). This is much better than the 2 best 2 well-known 2 2 bound, 2 t = O (d 2 log 2 2 N. For the special case d = 2, there exists an efficient nonrandom construction in which at most two defective items can be identified in time 4 log 2 2 N using t = 4 log 2 2 N tests. Numerical results show that our proposed scheme is more practical than existing ones, and experimental results confirm our theoretical analysis. In particular, up to 2 7 = 128 defective items can be identified in less than 16 s even for N = 2 100 .

Identifier

85064039205 (Scopus)

Publication Title

Journal of Information Processing

External Full Text Location

https://doi.org/10.2197/ipsjjip.27.245

e-ISSN

18826652

ISSN

03875806

First Page

245

Last Page

256

Volume

27

Grant

18H04120

Fund Ref

Japan Society for the Promotion of Science

This document is currently not available here.

Share

COinS