{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:12:59Z","timestamp":1753600379384,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1109\/allerton.2009.5394787","type":"proceedings-article","created":{"date-parts":[[2010,1,26]],"date-time":"2010-01-26T12:35:50Z","timestamp":1264509350000},"page":"355-362","source":"Crossref","is-referenced-by-count":17,"title":["Noisy group testing: An information theoretic perspective"],"prefix":"10.1109","author":[{"given":"George","family":"Atia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Saligrama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"7","article-title":"Bounds of the length of disjunct codes","volume":"11","author":"dyachkov","year":"1982","journal-title":"PROBLEMS CONTROL INFORM THEORY"},{"key":"ref11","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 n others","volume":"51","author":"ruszink\u00f3","year":"1985","journal-title":"Isr J Math"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(85)90022-9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1013122"},{"journal-title":"Group testing and sparse signal recovery","year":"2008","author":"gilbert","key":"ref14"},{"article-title":"Boolean compressed sensing and noisy group testing","year":"2009","author":"atia","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"article-title":"Codes to unmask spectrum violators","year":"0","author":"atia","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/DYSPAN.2008.53"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"article-title":"Thresholded basis pursuit: Support recovery for sparse and approximately sparse signals","year":"2008","author":"saligrama","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02772959"},{"key":"ref7","first-page":"1","article-title":"A survey of superimposed code theory","volume":"12","author":"dyachkov","year":"1983","journal-title":"Problems of Control and Information Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/j.dam.2006.10.009","article-title":"Exploring the missing link among d-separable, -separable and d-disjunct matrices","volume":"155","author":"chen","year":"2007","journal-title":"Discrete Applied Mathematics"},{"journal-title":"Combinatorial Group Testing and its Applications","year":"2000","author":"du","key":"ref1"}],"event":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2009,9,30]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2009,10,2]]}},"container-title":["2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5375733\/5394483\/05394787.pdf?arnumber=5394787","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:06:25Z","timestamp":1497830785000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5394787\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/allerton.2009.5394787","relation":{},"subject":[],"published":{"date-parts":[[2009,9]]}}}