The search functionality is under construction.
The search functionality is under construction.

A New Upper Bound for Finding Defective Samples in Group Testing

Jin-Taek SEONG

  • Full Text Views

    0

  • Cite this

Summary :

The aim of this paper is to show an upper bound for finding defective samples in a group testing framework. To this end, we exploit minimization of Hamming weights in coding theory and define probability of error for our decoding scheme. We derive a new upper bound on the probability of error. We show that both upper and lower bounds coincide with each other at an optimal density ratio of a group matrix. We conclude that as defective rate increases, a group matrix should be sparser to find defective samples with only a small number of tests.

Publication
IEICE TRANSACTIONS on Information Vol.E103-D No.5 pp.1164-1167
Publication Date
2020/05/01
Publicized
2020/02/17
Online ISSN
1745-1361
DOI
10.1587/transinf.2019EDL8187
Type of Manuscript
LETTER
Category
Fundamentals of Information Systems

Authors

Jin-Taek SEONG
  Mokpo National University

Keyword