{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:24:43Z","timestamp":1775053483199,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642368981","type":"print"},{"value":"9783642368998","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36899-8_25","type":"book-chapter","created":{"date-parts":[[2013,3,5]],"date-time":"2013-03-05T06:33:37Z","timestamp":1362465217000},"page":"509-533","source":"Crossref","is-referenced-by-count":11,"title":["Superimposed Codes and Threshold Group Testing"],"prefix":"10.1007","author":[{"given":"Arkadii","family":"D\u2019yachkov","sequence":"first","affiliation":[]},{"given":"Vyacheslav","family":"Rykov","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Deppe","sequence":"additional","affiliation":[]},{"given":"Vladimir","family":"Lebedev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Ahlswede, R., Deppe, C., Lebedev, V.: Bounds for threshold and majority group testing. In: 2011 IEEE International Symposium on Information Theory, Sankt-Peterburg, pp. 69\u201373 (2011)","DOI":"10.1109\/ISIT.2011.6034222"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Ahlswede, R., Wegener, I.: Suchprobleme, Teubner (1979), MIR russ. edition (1981), Wiley engl. edition (1987)","DOI":"10.1007\/978-3-322-91203-9"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1016\/j.dam.2008.06.003","volume":"157","author":"H.B. Chen","year":"2009","unstructured":"Chen, H.B., Fu, H.L.: Nonadaptive algorithms for threshold group testing. Discrete Applied Mathematics\u00a0157, 1581\u20131585 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M.: Improved constructions for non-adaptive threshold group testing. In: Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), arXiv:1002.2244 (2010)","DOI":"10.1007\/978-3-642-14165-2_47"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Copperersmith, D., Shearer, J.: New bounds for union-free families of sets. The Electronic Journal of Combinatorics\u00a05(1), R39 (1998)","DOI":"10.37236\/1377"},{"key":"25_CR6","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"I. Csiz\u00e1r","year":"1981","unstructured":"Csiz\u00e1r, I., K\u00f6rner, J.: Information Theory: Coding Theorems for Discrete Memoryless Systems. Academiai Kiado, Budapest (1981)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Damaschke, P.: Threshold group testing. In: General Theory of Information Transfer and Combinatorics, pp. 707\u2013718. Kluwer Academic Publishers (2006)","DOI":"10.1007\/11889342_45"},{"issue":"10","key":"25_CR8","doi-asserted-by":"publisher","first-page":"4673","DOI":"10.1109\/TIT.2006.881740","volume":"52","author":"A. Bonis De","year":"2006","unstructured":"De Bonis, A., Vaccaro, U.: Optimal algorithms for group testing problems, and new bounds on generalized superimposed codes. IEEE Trans. Inf. Theory\u00a052(10), 4673\u20134680 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"25_CR9","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1214\/aoms\/1177731363","volume":"14","author":"R. Dorfman","year":"1943","unstructured":"Dorfman, R.: The detection of defective members of large populations. The Annals of Mathematical Statistics\u00a014(4), 436\u2013440 (1943)","journal-title":"The Annals of Mathematical Statistics"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"D\u2019yachkov, A.G.: Superimposed designs and codes for non-adaptive search of mutually obscuring defectives. In: 2003 IEEE International Symposium on Information Theory, Yokohama, p. 134 (2003)","DOI":"10.1109\/ISIT.2003.1228148"},{"key":"25_CR11","unstructured":"D\u2019yachkov, A.G.: Lectures on Designing Screening Experiments. Lecture Note Series\u00a010, Monograph, p. 112, Combinatorial and Computational Mathematics Center, Pohang University of Science and Technology (POSTECH) (February 2004)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"D\u2019yachkov, A.G., Macula, A.J., Torney, D.C., Vilenkin, P.A.: Two models of non-adaptive group testing for designing screening experiments. In: Advances in Model Oriented Design and Analysis: Proceedings of the 6th International Workshop on Model Oriented Design and Analysis, Puchberg\/Schneeberg, Austria, June 25-29, pp. 63\u201375. Physica-Verlag, Heidelberg (2001)","DOI":"10.1007\/978-3-642-57576-1_8"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1006\/jcta.2002.3257","volume":"99","author":"A. D\u2019yachkov","year":"2002","unstructured":"D\u2019yachkov, A., Macula, A., Torney, D., Vilenkin, P.: Families of finite sets in which no intersection of \u0142 sets is covered by the union of s others. Journal of Combinatorial Theory, Series A\u00a099, 195\u2013218 (2002)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"D\u2019yachkov, A.G., Macula, A.J., Rykov, V.V.: New applications and results of superimposed code theory arising from the potentialities of molecular biology. In: Numbers, Information and Complexity, pp. 265\u2013282. Kluwer Academic Publishers (2000)","DOI":"10.1007\/978-1-4757-6048-4_22"},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/18.817530","volume":"46","author":"A.G. D\u2019yachkov","year":"2000","unstructured":"D\u2019yachkov, A.G., Macula, A.J., Rykov, V.V.: New constructions of superimposed codes. IEEE Trans. Inf. Theory\u00a046(1), 284\u2013290 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"25_CR16","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1016\/0026-2714(89)90022-X","volume":"29","author":"A.G. D\u2019yachkov","year":"1989","unstructured":"D\u2019yachkov, A.G., Rashad, A.M.: Universal decoding for random design of screening experiments. Microelectronics and Reliability\u00a029(6), 965\u2013971 (1989)","journal-title":"Microelectronics and Reliability"},{"issue":"3","key":"25_CR17","first-page":"7","volume":"18","author":"A.G. D\u2019yachkov","year":"1982","unstructured":"D\u2019yachkov, A.G., Rykov, V.V.: Bounds on the length of disjunct codes. Problemy Peredachi Informatsii\u00a018(3), 7\u201313 (1982) (in Russian)","journal-title":"Problemy Peredachi Informatsii"},{"issue":"4","key":"25_CR18","first-page":"229","volume":"12","author":"A.G. D\u2019yachkov","year":"1983","unstructured":"D\u2019yachkov, A.G., Rykov, V.V.: A survey of superimposed code theory. Problems of Control and Inf. Theory\u00a012(4), 229\u2013242 (1983)","journal-title":"Problems of Control and Inf. Theory"},{"key":"25_CR19","unstructured":"D\u2019yachkov, A.G., Rykov, V.V.: Generalized superimposed codes and their application to random multiple access. In: Proc. of the 6th International Symposium on Information Theory, Part\u00a01, Taschkent (1984)"},{"key":"25_CR20","unstructured":"D\u2019yachkov, A.G., Rykov, V.V.: On a model of associative memory. Problemy Peredachi Inform\u00a024(3), 107\u2013110 (1988) (in Russian)"},{"issue":"4","key":"25_CR21","first-page":"237","volume":"18","author":"A.G. D\u2019yachkov","year":"1989","unstructured":"D\u2019yachkov, A.G., Rykov, V.V., Rashad, A.M.: Superimposed distance codes. Problems of Control and Inform. Theory\u00a018(4), 237\u2013250 (1989)","journal-title":"Problems of Control and Inform. Theory"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"D\u2019yachkov, A.G., Rykov, V.V.: The capacity of the boolean associative memory. In: Proc. of the 5th International Conference on Artificial Neural Networks, Churchill Colledge, Cambridge, UK, pp. 158\u2013160 (1997)","DOI":"10.1049\/cp:19970719"},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0378-3758(01)00140-9","volume":"100","author":"A.G. D\u2019yachkov","year":"2002","unstructured":"D\u2019yachkov, A.G., Rykov, V.V.: Optimal superimposed codes and designs for R\u00e9nyi\u2019s search model. Journal of Statistical Planning and Inference\u00a0100, 281\u2013302 (2002)","journal-title":"Journal of Statistical Planning and Inference"},{"key":"25_CR24","unstructured":"D\u2019yachkov, A.G., Vilenkin, P.A., Yekhanin, S.M.: Upper bounds on the rate of superimposed (s,\u2113)-codes, based on Engel\u2019s inequality. In: Proceedings of the 8th International Workshop Algebraic and Combinatorial Coding Theory, Tsarskoe Selo, Russia, pp. 95\u201399 (2002)"},{"key":"25_CR25","doi-asserted-by":"publisher","DOI":"10.1142\/1936","volume-title":"Combinatorial group testing and its applications","author":"D.-Z. Du","year":"1993","unstructured":"Du, D.-Z., Hwang, F.K.: Combinatorial group testing and its applications. World Scientific, Singapore (1993)"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Emad, A., Milenkovic, O.: Semi-quantitative group testing. Arxiv-1202.2887 (2011)","DOI":"10.1109\/ISIT.2012.6283599"},{"issue":"2","key":"25_CR27","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1109\/TIT.2009.2037043","volume":"56","author":"Y. Erlich","year":"2010","unstructured":"Erlich, Y., Gordon, A., Brand, M., Hannon, G., Mitra, P.: Compressed genotyping. IEEE Trans. Inf. Theory\u00a056(2), 706\u2013723 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"25_CR28","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"W.H. Kautz","year":"1964","unstructured":"Kautz, W.H., Singleton, R.C.: Nonrandom Binary Superimposed Codes. IEEE Trans. Inf. Theory\u00a010(4), 363\u2013377 (1964)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"25_CR29","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/B:PRIT.0000044255.42299.4f","volume":"40","author":"H. Kim","year":"2004","unstructured":"Kim, H., Lebedev, V.S.: On the optimality of trivial (w,r) cover-free codes. Probl. Inf. Transm.\u00a040(3), 195\u2013201 (2004)","journal-title":"Probl. Inf. Transm."},{"issue":"2","key":"25_CR30","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/jcd.10056","volume":"12","author":"H. Kim","year":"2004","unstructured":"Kim, H., Lebedev, V.S.: On optimal superimposed codes. Journal of Combinatorial Designs\u00a012(2), 79\u201391 (2004)","journal-title":"Journal of Combinatorial Designs"},{"issue":"4","key":"25_CR31","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1023\/B:PRIT.0000011270.09033.8f","volume":"39","author":"V.S. Lebedev","year":"2003","unstructured":"Lebedev, V.S.: An asymptotic upper bound on the rate of (w,r)-cover-free codes. Probl. Inf. Transm.\u00a039(4), 317\u2013323 (2003)","journal-title":"Probl. Inf. Transm."},{"key":"25_CR32","unstructured":"Lebedev, V.S.: Some tables for (w, r) superimposed codes. In: Proceedings of the 8th International Workshop, Algebraic and Combinatorial Coding Theory, Tsarskoe Selo, Russia, pp. 185\u2013189 (2002)"},{"issue":"1","key":"25_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1134\/S0032946010010011","volume":"46","author":"V.S. Lebedev","year":"2010","unstructured":"Lebedev, V.S.: Separating codes and a new combinatorial search model. Probl. Inf. Transm.\u00a046(1), 1\u20136 (2010)","journal-title":"Probl. Inf. Transm."},{"key":"25_CR34","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. North Holland (1977)"},{"key":"25_CR35","first-page":"144","volume-title":"Proceedings of the IEEE-USSR Joint Workshop on Information Theory","author":"M.B. Maljutov","year":"1976","unstructured":"Maljutov, M.B.: On planning screening experiments. In: Proceedings of the IEEE-USSR Joint Workshop on Information Theory, pp. 144\u2013147. Inst. Electr. Electron. Engrs., New York (1976)"},{"issue":"1","key":"25_CR36","first-page":"42","volume":"244","author":"M.B. Maljutov","year":"1979","unstructured":"Maljutov, M.B., Mateev, P.S.: The design of screening experiments with a nonsymmetric response function. Dokl. Akad. Nauk SSSR\u00a0244(1), 42\u201346 (1979)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"1","key":"25_CR37","first-page":"109","volume":"27","author":"M.B. Maljutov","year":"1980","unstructured":"Maljutov, M.B., Mateev, P.S.: Design of screening experiments with a nonsymmetric response function. Mat. Zametki\u00a027(1), 109\u2013127 (1980)","journal-title":"Mat. Zametki"},{"issue":"4","key":"25_CR38","first-page":"223","volume":"17","author":"A. Nguyen Quang","year":"1988","unstructured":"Nguyen Quang, A., Zeisel, T.: Bounds on constant weight binary syperimposed codes. Probl. of Control and Inform. Theory\u00a017(4), 223\u2013230 (1988)","journal-title":"Probl. of Control and Inform. Theory"},{"issue":"2","key":"25_CR39","first-page":"141","volume":"19","author":"A.M. Rashad","year":"1990","unstructured":"Rashad, A.M.: Random coding bounds on the rate for list-decoding superimposed codes. Problems of Control and Inform. Theory\u00a019(2), 141\u2013149 (1990)","journal-title":"Problems of Control and Inform. Theory"},{"key":"25_CR40","unstructured":"R\u00e9nyi, A.: On a problem of information theory. MTA Mat. Kut. Int. Kozl., 6B, 505\u2013516 (1961)"},{"key":"25_CR41","doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal 27, 379\u2013423 & 623\u2013656 (1948)","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"}],"container-title":["Lecture Notes in Computer Science","Information Theory, Combinatorics, and Search Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36899-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,23]],"date-time":"2020-07-23T05:20:05Z","timestamp":1595481605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36899-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642368981","9783642368998"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36899-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}