By Topic

Bounds for threshold and majority group testing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Rudolf Ahlswede ; Department of Mathematics, University of Bielefeld, Germany ; Christian Deppe ; Vladimir Lebedev

We consider two generalizations of group testing: threshold group testing (introduced by Damaschke [8]) and majority group testing (a further generalization, including threshold group testing and a model introduced by Lebedev [15]). We show that each separating code gives a nonadaptive strategy for threshold group testing for some parameters. This is a generalization of a results on "guessing secrets", introduce. We introduce threshold codes and show that each threshold code gives a nonadaptive strategy for threshold group testing. We show that there exist threshold codes such that we can improve the lower bound for the rate of threshold group testing. We consider majority group testing if the number of defective elements is unknown (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.

Published in:

Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on

Date of Conference:

July 31 2011-Aug. 5 2011