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

Thach V. Bui, Minoru Kuribayashi, Tetsuya Kojima, Roghayyeh Haghvirdinezhad, Isao Echizen

Research output: Contribution to journalArticle

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 .

Original languageEnglish
Pages (from-to)245-256
Number of pages12
JournalJournal of Information Processing
Volume27
DOIs
Publication statusPublished - Jan 1 2019

Fingerprint

Decoding
Testing

Keywords

  • Combinatorics
  • Efficient decoding
  • Non-adaptive group testing
  • Nonrandom construction

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Efficient (Nonrandom) construction and decoding for non-adaptive group testing. / Bui, Thach V.; Kuribayashi, Minoru; Kojima, Tetsuya; Haghvirdinezhad, Roghayyeh; Echizen, Isao.

In: Journal of Information Processing, Vol. 27, 01.01.2019, p. 245-256.

Research output: Contribution to journalArticle

Bui, Thach V. ; Kuribayashi, Minoru ; Kojima, Tetsuya ; Haghvirdinezhad, Roghayyeh ; Echizen, Isao. / Efficient (Nonrandom) construction and decoding for non-adaptive group testing. In: Journal of Information Processing. 2019 ; Vol. 27. pp. 245-256.
@article{52d9bbc6563f4cdf895ed52691e39c77,
title = "Efficient (Nonrandom) construction and decoding for non-adaptive group testing",
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 .",
keywords = "Combinatorics, Efficient decoding, Non-adaptive group testing, Nonrandom construction",
author = "Bui, {Thach V.} and Minoru Kuribayashi and Tetsuya Kojima and Roghayyeh Haghvirdinezhad and Isao Echizen",
year = "2019",
month = "1",
day = "1",
doi = "10.2197/ipsjjip.27.245",
language = "English",
volume = "27",
pages = "245--256",
journal = "Journal of Information Processing",
issn = "0387-5806",
publisher = "Information Processing Society of Japan",

}

TY - JOUR

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

AU - Bui, Thach V.

AU - Kuribayashi, Minoru

AU - Kojima, Tetsuya

AU - Haghvirdinezhad, Roghayyeh

AU - Echizen, Isao

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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 .

AB - 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 .

KW - Combinatorics

KW - Efficient decoding

KW - Non-adaptive group testing

KW - Nonrandom construction

UR - http://www.scopus.com/inward/record.url?scp=85064039205&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85064039205&partnerID=8YFLogxK

U2 - 10.2197/ipsjjip.27.245

DO - 10.2197/ipsjjip.27.245

M3 - Article

AN - SCOPUS:85064039205

VL - 27

SP - 245

EP - 256

JO - Journal of Information Processing

JF - Journal of Information Processing

SN - 0387-5806

ER -