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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahlswede, R., Deppe, C., Lebedev, V.: Majority Group Testing with Density Tests. In: Proceedings of the IEEE ISIT 2011, pp. 291–295 (2011)
Ahlswede, R., Deppe, C., Lebedev, V.: Finding one of defective elements in some group testing models. Problems of Information Transmission 48(2), 173–181 (2012)
Ahlswede, R., Wegener, I.: Suchprobleme, Teubner Verlag, Stuttgart (1979), Russian Edition: Zadatsi Poiska, MIR (1982), English Edition: Search Problems. Wiley-Interscience Series in Discrete Mathematics and Optimization (1987)
Alon, N., Guruswami, V., Kaufman, T., Sudan, M.: Guessing secrets efficiently via list decoding. In: 13th SODA, pp. 254–262 (2002)
Chang, H., Chen, H.-B., Fu, H.-L., Shi, C.-H.: Reconstruction of hidden graphs and threshold group testing. J. on Comb. Opt. 22(2), 270–281 (2010)
Chen, H.-B., Fu, H.-L.: Nonadaptive algorithms for threshold group testing. Discrete Appl. Math. 157(7), 1581–1585 (2009)
Chen, H.-B., Fu, H.-L., Hwang, F.K.: An upper bound of the number of tests in pooling designs for the error-tolerant complex model. Opt. Lett. 2, 425–431 (2008)
Cheraghchi, M.: Improved constructions for non-adaptive threshold group testing. In: ICALP, vol. 1, pp. 552–564 (2010)
Chung, F., Graham, R., Leighton, F.T.: Guessing secrets. Electronic J. on Combinatorics 8, 1–25 (2001)
Cohen, G., Schaathun, H.G.: Asymptotic overview on separating codes, Technical report, No. 248 from Department of Informatics, University of Bergen (2003)
Damaschke, P.: Threshold Group Testing. In: Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 707–718. Springer, Heidelberg (2006)
Deppe, C., D’yachkov, A., Lebedev, V., Rykov, V.: Superimposed codes and threshold group testing. In: Aydinian, H., Cicalese, F., Deppe, C. (eds.) Ahlswede Festschrift. LNCS, vol. 7777, pp. 509–533. Springer, Heidelberg (2013)
Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and its Applications, 2nd edn. Series on Applied Mathematics, vol. 12. World Scientific Publishing Co. Pte. Ltd, Hackensack (2000)
Du, D.Z., Hwang, F.K.: Pooling Designs and Nonadaptive Group Testing. Important Tools for DNA Sequencing. Series on Applied Mathematics, vol. 18. World Scientific Publishing Co. Pte. Ltd, Hackensack (2006)
D’yachkov, A., Macula, A., Vilenkin, P., Torney, D.: Families of finite sets in which no intersection of l sets is covered by the union of s others. J. Combin. Theory Ser. A. 99(2), 195–218 (2002)
D’yachkov, A., Macula, A., Vilenkin, P., Torney, D.: Two models of nonadaptive group testing for designing screening experiments. In: Proc. 6th Int.Workshop on Model-Orented Designs and Analysis, pp. 63–75 (2001)
Gerbner, D., Keszegh, B., Pálvölgyi, D., Wiener, G.: Density-Based Group Testing. In: Aydinian, H., Cicalese, F., Deppe, C. (eds.) Ahlswede Festschrift. LNCS, vol. 7777, pp. 543–556. Springer, Heidelberg (2013)
Kautz, W., Singleton, R.: Nonrandom binary superimposed codes. IEEE Trans. Information Theory 10(4), 363–377 (1964)
Lebedev, V.S.: An asymptotic upper bound for the rate of (w,r)-cover-free codes. Probl. Inf. Transm. 39(4), 317–323 (2003)
Lebedev, V.S.: Separating codes and a new combinatorial search model. Probl. Inf. Transm. 46(1), 1–6 (2010)
Mitchell, C.J., Piper, F.C.: Key storage in secure networks. Discrete Appl. Math. 21(3), 215–228 (1988)
Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proceedings. of th 36th Annual Symposium on Foundations of Computer Science, pp. 182–191 (1995)
Stinson, D.R.: Generalized cover-free families, In honour of Zhu Lie. Discrete Math. 279(1-3), 463–477 (2004)
Stinson, D.R., van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. Journal of Statistical Planning and Inference 86, 595–617 (2000)
Stinson, D.R., Wei, R., Zhu, L.: Some new bounds for cover-free families. J. Combin. Theory A. 90, 224–234 (2000)
Torney, D.C.: Sets pooling designs. Ann. Combin. 3, 95–101 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ahlswede, R., Deppe, C., Lebedev, V. (2013). Threshold and Majority Group Testing. In: Aydinian, H., Cicalese, F., Deppe, C. (eds) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol 7777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36899-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-36899-8_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36898-1
Online ISBN: 978-3-642-36899-8
eBook Packages: Computer ScienceComputer Science (R0)