{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:39Z","timestamp":1725456999480},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642352607"},{"type":"electronic","value":"9783642352614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35261-4_67","type":"book-chapter","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T01:59:41Z","timestamp":1355450381000},"page":"649-658","source":"Crossref","is-referenced-by-count":11,"title":["On Almost Disjunct Matrices for Group Testing"],"prefix":"10.1007","author":[{"given":"Arya","family":"Mazumdar","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"67_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. Wiley & Sons (2000)","DOI":"10.1002\/0471722154"},{"issue":"7","key":"67_CR2","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TCOM.1984.1096146","volume":"32","author":"T. Berger","year":"1984","unstructured":"Berger, T., Mehravari, N., Towsley, D., Wolf, J.: Random multiple-access communications and group testing. IEEE Transactions on Communications\u00a032(7), 769\u2013779 (1984)","journal-title":"IEEE Transactions on Communications"},{"issue":"4","key":"67_CR3","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1109\/JSTSP.2010.2043161","volume":"4","author":"R. Calderbank","year":"2010","unstructured":"Calderbank, R., Howard, S., Jafarpour, S.: Construction of a large class of deterministic sensing Matrices that satisfy a statistical isometry property. IEEE Journal of Selected Topics in Signal Processing\u00a04(4), 358\u2013374 (2010)","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"key":"67_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-642-14165-2_47","volume-title":"Automata, Languages and Programming","author":"M. Cheraghchi","year":"2010","unstructured":"Cheraghchi, M.: Improved Constructions for Non-adaptive Threshold\u00a0Group\u00a0Testing. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 552\u2013564. Springer, Heidelberg (2010)"},{"key":"67_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"B. Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing Traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 257\u2013270. Springer, Heidelberg (1994)"},{"key":"67_CR6","volume-title":"Stochastic Processes","author":"J.L. Doob","year":"1953","unstructured":"Doob, J.L.: Stochastic Processes. John Wiley & Sons, New York (1953)"},{"key":"67_CR7","doi-asserted-by":"crossref","unstructured":"Du, D., Hwang, F.: Combinatorial Group Testing and Applications. World Scientific Publishing (2000)","DOI":"10.1142\/4252"},{"key":"67_CR8","first-page":"7","volume":"18","author":"A. Dyachkov","year":"1982","unstructured":"Dyachkov, A., Rykov, V.: Bounds on the length of disjunctive codes. Problemy Peredachi Informatsii\u00a018, 7\u201313 (1982)","journal-title":"Problemy Peredachi Informatsii"},{"key":"67_CR9","doi-asserted-by":"crossref","unstructured":"D\u2019yachkov, A., Rykov, V., Macula, A.: New constructions of superimposed codes. IEEE Transactions on Information Theory\u00a046(1) (2000)","DOI":"10.1109\/18.817530"},{"issue":"4","key":"67_CR10","first-page":"237","volume":"18","author":"A. Dyachkov","year":"1989","unstructured":"Dyachkov, A., Rykov, V., Rashad, A.: Superimposed distance codes. Problems of Control and Information Theory\u00a018(4), 237\u2013250 (1989)","journal-title":"Problems of Control and Information Theory"},{"issue":"2","key":"67_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1006\/jcta.2002.3257","volume":"99","author":"A. Dyachkov","year":"2002","unstructured":"Dyachkov, A., Vilenkin, P., Torney, D., Macula, A.: Families of finite sets in which no intersection of l sets is covered by the union of s other. Journal of Combinatorial Theory, Series A\u00a099(2), 195\u2013218 (2002)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"67_CR12","doi-asserted-by":"crossref","unstructured":"Gilbert, A., Hemenway, B., Rudra, A., Strauss, M., Wootters, M.: Recovering simple signals (manuscript, 2012)","DOI":"10.1109\/ITA.2012.6181772"},{"key":"67_CR13","doi-asserted-by":"crossref","unstructured":"Gilbert, A., Iwen, M., Strauss, M.: Group testing and sparse signal recovery. In: Proc. 42nd Asilomar Conference on Signals, Systems and Computers (2008)","DOI":"10.1109\/ACSSC.2008.5074574"},{"key":"67_CR14","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1080\/01621459.1972.10481257","volume":"67","author":"F. Hwang","year":"1972","unstructured":"Hwang, F.: A method for detecting all defective members in a population by group testing. Journal of American Statistical Association\u00a067, 605\u2013608 (1972)","journal-title":"Journal of American Statistical Association"},{"key":"67_CR15","first-page":"257","volume":"22","author":"F. Hwang","year":"1987","unstructured":"Hwang, F., Sos, V.: Non-adaptive hypergeometric group testing. Studia Scient. Math. Hungarica.\u00a022, 257\u2013263 (1987)","journal-title":"Studia Scient. Math. Hungarica."},{"issue":"4","key":"67_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"W. Kautz","year":"1964","unstructured":"Kautz, W., Singleton, R.: Nonrandom binary superimposed codes. IEEE Transaction on Information Theory\u00a010(4), 185\u2013191 (1964)","journal-title":"IEEE Transaction on Information Theory"},{"issue":"1-2","key":"67_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.dam.2003.07.009","volume":"144","author":"A. Macula","year":"2004","unstructured":"Macula, A., Popyack, L.: A group testing method for finding patterns in data. Discrete Applied Mathematics\u00a0144(1-2), 149\u2013157 (2004)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"67_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0166-218X(03)00191-4","volume":"137","author":"A. Macula","year":"2004","unstructured":"Macula, A., Rykov, V., Yekhanin, S.: Trivial two-stage group testing for complexes using almost disjunct matrices. Discrete Applied Mathematics\u00a0137(1), 97\u2013107 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"67_CR19","unstructured":"Macwilliams, F., Sloane, N.: The Theory of Error-Correcting Codes. North-Holland (1977)"},{"issue":"1","key":"67_CR20","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/BF01104893","volume":"23","author":"M. Malyutov","year":"1978","unstructured":"Malyutov, M.: The separating property of random matrices. Mathematical Notes\u00a023(1), 84\u201391 (1978)","journal-title":"Mathematical Notes"},{"key":"67_CR21","doi-asserted-by":"crossref","unstructured":"Mazumdar, A., Barg, A.: Sparse-Recovery Properties of Statistical RIP Matrices. In: Proc. 49th Allerton Conference on Communication, Control and Computing, Monticello, IL, September 28\u201330 (2011)","DOI":"10.1109\/Allerton.2011.6120142"},{"key":"67_CR22","doi-asserted-by":"crossref","unstructured":"McDiarmid, C.: On the method of bounded differences. In: Surveys in Combinatorics, Cambridge. London Math. Soc. Lectures Notes, pp. 148\u2013188 (1989)","DOI":"10.1017\/CBO9781107359949.008"},{"key":"67_CR23","doi-asserted-by":"crossref","unstructured":"Ngo, H., Du, D.: A survey on combinatorial group testing algorithms with applications to DNA library screening. In: Discrete Mathematical Problems with Medical Applications. DIMACS Series Discrete Mathematics and Theoretical Computer Science, vol.\u00a055, pp. 171\u2013182 (1999)","DOI":"10.1090\/dimacs\/055\/13"},{"key":"67_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1007\/978-3-540-70575-8_61","volume-title":"Automata, Languages and Programming","author":"E. Porat","year":"2008","unstructured":"Porat, E., Rothschild, A.: Explicit Non-adaptive Combinatorial Group Testing Schemes. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 748\u2013759. Springer, Heidelberg (2008)"},{"key":"67_CR25","doi-asserted-by":"crossref","unstructured":"R.\u00a0Roth, Introduction to Coding Theory, Cambridge, 2006.","DOI":"10.1017\/CBO9780511808968"},{"issue":"3","key":"67_CR26","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"J.N. Staddon","year":"2001","unstructured":"Staddon, J.N., Stinson, D.R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Transaction on Information Theory\u00a047(3), 1042\u20131049 (2001)","journal-title":"IEEE Transaction on Information Theory"},{"issue":"1","key":"67_CR27","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1006\/jcta.1999.3036","volume":"90","author":"D.R. Stinson","year":"2000","unstructured":"Stinson, D.R., Wei, R., Zhu, L.: Some new bounds for cover-free families. Journal of Combinatorial Theory, Series A\u00a090(1), 224\u2013234 (2000)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"67_CR28","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/TIT.1985.1057026","volume":"31","author":"J. Wolf","year":"1985","unstructured":"Wolf, J.: Born again group testing: multiaccess communications. IEEE Transaction on Information Theory\u00a031, 185\u2013191 (1985)","journal-title":"IEEE Transaction on Information Theory"},{"key":"67_CR29","unstructured":"Yekhanin, S.: Some new constructions of optimal superimposed designs. In: Proc. of International Conference on Algebraic and Combinatorial Coding Theory (ACCT), pp. 232\u2013235 (1998)"},{"issue":"1","key":"67_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0378-3758(02)00148-9","volume":"115","author":"A. Zhigljavsky","year":"2003","unstructured":"Zhigljavsky, A.: Probabilistic existence theorems in group testing. Journal of Statistical Planning and Inference\u00a0115(1), 1\u201343 (2003)","journal-title":"Journal of Statistical Planning and Inference"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35261-4_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T19:23:34Z","timestamp":1595100214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35261-4_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352607","9783642352614"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35261-4_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}