{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:18:57Z","timestamp":1772893137928,"version":"3.50.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2014,5,1]],"date-time":"2014-05-01T00:00:00Z","timestamp":1398902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1109\/tit.2014.2310477","type":"journal-article","created":{"date-parts":[[2014,3,11]],"date-time":"2014-03-11T18:03:16Z","timestamp":1394560996000},"page":"3019-3035","source":"Crossref","is-referenced-by-count":108,"title":["Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms"],"prefix":"10.1109","volume":"60","author":[{"family":"Chun Lam Chan","sequence":"first","affiliation":[]},{"given":"Sidharth","family":"Jaggi","sequence":"additional","affiliation":[]},{"given":"Venkatesh","family":"Saligrama","sequence":"additional","affiliation":[]},{"given":"Samar","family":"Agnihotri","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173241"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-007-9003-x"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref36","author":"rice","year":"2006","journal-title":"Mathematical Statistics and Data Analysis"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1859204.1859229"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016006"},{"key":"ref10","author":"d'yachkov","year":"2004","journal-title":"Lectures on Designing Screening Experiments"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9083-3"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1142\/6122","author":"du","year":"2006","journal-title":"Pooling Designs and Nonadaptive Group Testing - Important Tools for DNA Sequencing"},{"key":"ref14","first-page":"109","article-title":"Screening designs for non-symmetric response function","volume":"27","author":"malyutov","year":"1980","journal-title":"Math Zametki"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1515\/rose.1998.6.4.311"},{"key":"ref16","author":"mcwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0026-2714(89)90022-X"},{"key":"ref18","first-page":"7","article-title":"Bounds on the length of disjunctive codes","volume":"18","author":"dyachkov","year":"1982","journal-title":"Problemly Peredachi Inf"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(82)90004-8"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01609876"},{"key":"ref4","author":"du","year":"2000","journal-title":"Combinatorial Group Testing and its Applications"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286461"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)80002-9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/62.1.181"},{"key":"ref5","first-page":"1880","article-title":"Boolean compressed sensing and noisy group testing","volume":"58","author":"atia","year":"2013"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283597"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01104893"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120391"},{"key":"ref20","first-page":"237","article-title":"Superimposed distance codes","volume":"18","author":"dyachkov","year":"1989","journal-title":"Problems Control Inf Theory"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707018"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.0012"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SIBIRCON.2010.5555301"},{"key":"ref23","first-page":"1041","article-title":"Capacity of screening under linear programming analysis","author":"malyutov","year":"0","journal-title":"Proc 6th Simul Int Workshop Simul"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074574"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288622"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6800061\/06763117.pdf?arnumber=6763117","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:29:54Z","timestamp":1642004994000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6763117\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":37,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2310477","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5]]}}}