{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:52:21Z","timestamp":1778647941443,"version":"3.51.4"},"reference-count":39,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174462","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"525-530","source":"Crossref","is-referenced-by-count":6,"title":["Strongly Explicit and Efficiently Decodable Probabilistic Group Testing"],"prefix":"10.1109","author":[{"given":"Huseyin A.","family":"Inan","sequence":"first","affiliation":[{"name":"Stanford University,Department of Electrical Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayfer","family":"Ozgur","sequence":"additional","affiliation":[{"name":"Stanford University,Department of Electrical Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.3150\/14-BEJ605"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10095"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541824"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659619"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613870"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22006-7_47"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/18.556669"},{"key":"ref35","article-title":"Sublinear-time non-adaptive group testing with O(k log n) tests via bit-mixing coding","author":"bondorf","year":"2019","journal-title":"CoRR"},{"key":"ref34","article-title":"Group testing using left-and-right-regular sparse-graph codes","author":"vem","year":"2017","journal-title":"CoRR"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262800"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2951703"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854218"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/055\/13"},{"key":"ref14","volume":"12","author":"du","year":"2000","journal-title":"Combinatorial Group Testing and its Applications"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178156"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707018"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120391"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch4"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2314472"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03409-1_7"},{"key":"ref4","first-page":"765","article-title":"Exact rule learning via boolean compressed sensing","volume":"28","author":"malioutov","year":"2013","journal-title":"Proceedings of the 30th International Conference on Machine Learning"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_61"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2647600"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_15"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.91"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074574"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057026"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096146"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9083-3"},{"key":"ref9","first-page":"791","article-title":"Neighbor discovery in wireless ad hoc networks based on group testing","author":"luo","year":"2008","journal-title":"46th Annual Allerton Conference on Communication Control and Computing"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2861772"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2970184"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2844818"},{"key":"ref24","first-page":"7","article-title":"Bounds on the length of disjunctive codes","volume":"18","author":"d\u2019yachkov","year":"1982","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2902397"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.0012"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174462.pdf?arnumber=9174462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:30Z","timestamp":1773347670000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174462\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174462","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}