Problems of Information Transmission

, Volume 48, Issue 2, pp 173–181 | Cite as

Finding one of D defective elements in some group testing models

  • R. Ahlswede
  • C. DeppeEmail author
  • V. S. Lebedev
Large Systems


In contrast to the classical goal of group testing, we consider the problem of finding m defective elements out of D (mD). We analyze two different test functions. We give adaptive strategies and present lower bounds for the number of tests and show that our strategy is optimal for m = 1.


Group Testing Information Transmission Threshold Group Classical Goal Defective Element 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Du, D.-Z. and Hwang, F.K., Combinatorial Group Testing and Its Applications, Singapore: World Sci., 2000, 2nd ed.zbMATHGoogle Scholar
  2. 2.
    Du, D.-Z. and Hwang, F.K., Pooling Designs and Nonadaptive Group Testing. Important Tools for DNA Sequencing, Hackensack, NJ: World Sci., 2006.CrossRefzbMATHGoogle Scholar
  3. 3.
    Garey, M.R. and Hwang, F.K., Isolating a Single Defective Using Group Testing, J. Amer. Statist. Assoc., 1974, vol. 69, no. 345, pp. 151–153.MathSciNetzbMATHGoogle Scholar
  4. 4.
    Kumar, S. and Sobel, M., Finding a Single Defective in Binomial Group-Testing, J. Amer. Statist. Assoc., 1971, vol. 66, no. 336, pp. 824–828.MathSciNetzbMATHGoogle Scholar
  5. 5.
    Bar-Lev, S.K., Boneh, A., and Perry, D., Incomplete Identification Models for Group-Testable Items, Naval Res. Logistics, 1990, vol. 37, no. 5, pp. 647–659.CrossRefzbMATHGoogle Scholar
  6. 6.
    Katona, G.O.H., Finding at Least One Defective Element in Two Rounds, in Search Methodologies (Dagstuhl Seminar 09281, Schloss Dagstuhl — Leibniz-Zentrum für Informatik, Germany), 2009.Google Scholar
  7. 7.
    Gerbner, D., Keszegh, B., Pálvölgyi, D., and Wiener, G., Search with Density Tests, in Search Methodologies II (ZiF Workshop, Bielefeld, Germany, 2010), pp. 33.Google Scholar
  8. 8.
    Ahlswede, R. and Wegener, I., Suchprobleme, Stuttgart: Teubner, 1979.zbMATHGoogle Scholar
  9. 9.
    Lebedev, V.S., Separating Codes and a New Combinatorial Search Model, Probl. Peredachi Inf., 2010, vol. 46, no. 1, pp. 3–8 [Probl. Inf. Trans. (Engl. Transl.), 2010, vol. 46, no. 1, pp. 1–6].Google Scholar
  10. 10.
    Ahlswede, R., Deppe, C., and Lebedev, V.S., Threshold and Majority Group Testing, to appear in Lect. Notes Comp. Sci. Google Scholar
  11. 11.
    Damaschke, P., Threshold Group Testing, General Theory of Information Transfer and Combinatorics, Ahlswede, R., Bäumer, L., Cai, N., Aydinian H.K., Blinovsky, V., Deppe, C., and Mashurian, H., Eds., Lect. Notes Comp. Sci., vol. 4123, Berlin: Springer, 2006, p. 707–718.CrossRefGoogle Scholar
  12. 12.
    Hwang, F.K., AMethod for Detecting All Defective Members in a Population by Group Testing, J. Amer. Statist. Assoc., 1972, vol. 67, no. 339, pp. 605–608.zbMATHGoogle Scholar
  13. 13.
    D’yachkov, A.G. and Rykov, V.V., Optimal Superimposed Codes and Designs for Renyi’s Search Model, J. Statist. Plann. Inference, 2002, vol. 100, no. 2, pp. 281–302.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2012

Authors and Affiliations

  1. 1.Department of MathematicsUniversity of BielefeldBielefeldGermany
  2. 2.Kharkevich Institute for Information Transmission ProblemsRussian Academy of SciencesMoscowRussia

Personalised recommendations