{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:55:32Z","timestamp":1776956132697,"version":"3.51.4"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100008628","name":"Ministry of Electronics and Information technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008628","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/tsp.2018.2871441","type":"journal-article","created":{"date-parts":[[2018,9,24]],"date-time":"2018-09-24T21:20:32Z","timestamp":1537824032000},"page":"1-1","source":"Crossref","is-referenced-by-count":3,"title":["On Finding a Subset of Non-Defective Items from a Large Population"],"prefix":"10.1109","author":[{"given":"Abhay","family":"Sharma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chandra Ramabhadra","family":"Murthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1198\/004017007000000308"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2605122"},{"key":"ref31","first-page":"1","article-title":"A mutual information characterization for sparse signal processing","author":"atia","year":"0","journal-title":"Proc 38th Int Colloquium Automata Lang Program Switzerland"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref35","first-page":"998","article-title":"Note on noisy group testing: Asymptotic bounds and belief propagation reconstruction","author":"sejdinovic","year":"0","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.07.009"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2014.2305978"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02772959"},{"key":"ref13","first-page":"7","article-title":"Bounds on the length of disjunctive codes","volume":"18","author":"dyachkov","year":"1982","journal-title":"Problems Inf Transmiss"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(85)90022-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2148691"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01104893"},{"key":"ref17","first-page":"655","article-title":"On the maximal rate of screening designs","volume":"24","author":"malyutov","year":"1979","journal-title":"Theory Probab Appl"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01149816"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178156"},{"key":"ref28","article-title":"Finding zeros: Greedy detection of holes","author":"yoo","year":"2013","journal-title":"CoRR"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2748143"},{"key":"ref3","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":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864420"},{"key":"ref29","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/060657704"},{"key":"ref8","first-page":"1","article-title":"A cognitive radio approach for usage of virtual unlicensed\n spectrum","author":"cabric","year":"0","journal-title":"Proc 14th IST Mobile Wireless Commun Summit"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.839380"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref9","article-title":"Et docket no. 02-155","year":"2002","journal-title":"Spectrum policy task force report"},{"key":"ref1","first-page":"1","article-title":"On finding a set of healthy individuals from a large population","author":"sharma","year":"2013","journal-title":"Proc Inf Theory Appl Workshop"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310477"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(94)90067-1"},{"key":"ref21","first-page":"40","article-title":"Phase transitions in group testing","author":"scarlett","year":"0","journal-title":"Proc Twenty-Seventh Ann ACM-SIAM Symp Discrete Algorithms SODA"},{"key":"ref24","first-page":"245","article-title":"Bounds for error probability for a symmetrical model in\n designing screening experiments","volume":"17","author":"d\u2019yachkov","year":"1981","journal-title":"Problems Inform Transmiss"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2446433"},{"key":"ref26","first-page":"6090","article-title":"How little does non-exact recovery help in group testing?","author":"scarlett","year":"0","journal-title":"Proc Int Conf Acoust Speech Signal Process"},{"key":"ref25","first-page":"557","article-title":"Efficiently\n decodable error-correcting list disjunct matrices and applications (extended abstract)","author":"ngo","year":"0","journal-title":"Proc Int Colloq Automata Lang Program"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/4359509\/08470136.pdf?arnumber=8470136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T09:24:27Z","timestamp":1643189067000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8470136\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/tsp.2018.2871441","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}