{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T22:21:36Z","timestamp":1782253296172,"version":"3.54.5"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"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":[[2012,3]]},"DOI":"10.1109\/tit.2011.2178156","type":"journal-article","created":{"date-parts":[[2012,2,28]],"date-time":"2012-02-28T20:54:17Z","timestamp":1330462457000},"page":"1880-1901","source":"Crossref","is-referenced-by-count":213,"title":["Boolean Compressed Sensing and Noisy Group Testing"],"prefix":"10.1109","volume":"58","author":[{"given":"George K.","family":"Atia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Venkatesh","family":"Saligrama","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Sharp thresholds for high-dimensional and noisy sparsity recovery using <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell _{1}$<\/tex><\/formula>-constrained quadratic programs","author":"wainwright","year":"2006","journal-title":"Allerton Conf Communication Control and Comput"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2009.5470153"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032726"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1155\/ASP\/2006\/26318"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"ref15","first-page":"1","article-title":"A survey of superimposed code theory","volume":"12","author":"dyachkov","year":"1983","journal-title":"Probl Control Inf Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02772959"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.10.009"},{"key":"ref18","first-page":"7","article-title":"Bounds of the length of disjunct codes","volume":"11","author":"dyachkov","year":"1982","journal-title":"Probl Control Inf Theory"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02772959","article-title":"Family of finite sets in which no set is covered by the union of <formula formulatype=\"inline\"><tex Notation=\"TeX\">${\\rm n}$<\/tex><\/formula> others","volume":"51","author":"ruszink","year":"1985","journal-title":"Isr J Math"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref28","first-page":"109","article-title":"Screening design for non-symmetric response function","volume":"27","author":"malyutov","year":"1980","journal-title":"Mat Zemetki"},{"key":"ref3","author":"du","year":"2000","journal-title":"Combinatorial Group Testing and its Applications"},{"key":"ref27","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074687"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/DYSPAN.2008.53"},{"key":"ref29","author":"dyachkov","year":"2003","journal-title":"Lectures on Designing Screening Experiments"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref2","author":"atia","year":"2009","journal-title":"Boolean Compressed Sensing and Noisy Group Testing"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557348"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394787"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(85)90022-9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074574"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1013122"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref23","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":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059891"},{"key":"ref25","article-title":"A mutual information characterization for sparse signal processing","author":"atia","year":"2011","journal-title":"38th Int Colloquium on Automata Languages and Programming"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6157047\/06157065.pdf?arnumber=6157065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T08:06:19Z","timestamp":1640246779000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6157065\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":29,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2178156","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}