Threshold and majority group testing

  • Authors:

  • Rudolf Ahlswede;Christian Deppe;Vladimir Lebedev

  • Affiliations:

  • Department of Mathematics, University of Bielefeld, Germany;Department of Mathematics, University of Bielefeld, Germany;IPPI (Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute)), Russia

  • Venue:
  • Information Theory, Combinatorics, and Search Theory
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider two generalizations of group testing: threshold group testing (introduced by Damaschke [11]) and majority group testing (a further generalization, including threshold group testing and a model introduced by Lebedev [20]). We show that each separating code gives a nonadaptive strategy for threshold group testing for some parameters. This is a generalization of a result in [4] on "guessing secrets", introduced in [9]. We introduce threshold codes and show that each threshold code gives a nonadaptive strategy for threshold group testing. Threshold codes include also the construction of [6]. In contrast to [8], where the number of defectives is bounded, we consider the case when the number of defectives are known. We show that we can improve the rate in this case. We consider majority group testing if the number of defective elements is unknown but bounded (otherwise it reduces to threshold group testing). We show that cover-free codes and separating codes give strategies for majority group testing. We give a lower bound for the rate of majority group testing.