{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:49:30Z","timestamp":1774680570024,"version":"3.50.1"},"reference-count":44,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/allerton.2018.8635972","type":"proceedings-article","created":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T03:04:31Z","timestamp":1551409471000},"page":"188-195","source":"Crossref","is-referenced-by-count":14,"title":["On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing"],"prefix":"10.1109","author":[{"given":"Huseyin A.","family":"Inan","sequence":"first","affiliation":[]},{"given":"Peter","family":"Kairouz","sequence":"additional","affiliation":[]},{"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[]},{"given":"Ayfer","family":"Ozgur","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262800"},{"key":"ref38","article-title":"Efficiently decodable non-adaptive threshold group testing","volume":"abs 1712 7509","author":"bui","year":"2017","journal-title":"CoRR"},{"key":"ref33","first-page":"141","article-title":"Random coding bounds on the rate for list-decoding superimposed codes","volume":"19","author":"rashad","year":"1990","journal-title":"Probl Control Inform Theory\/Probl Upravlen Teor Inform"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703428002"},{"key":"ref31","first-page":"229","article-title":"A survey of superimposed code theory","volume":"12","author":"d\u2019yachkov","year":"1983","journal-title":"Probl Control Inform Theory\/Probl Upravlen Teor Inform"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310477"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14165-2_47"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.003"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/0605016"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-307550-5.50011-3"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1109\/ISIT.2009.5205769","article-title":"A sparsity detection framework for on-off random access channels","author":"fletcher","year":"2009","journal-title":"Information Theory 2009 ISIT 2009 IEEE International Symposium on"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852259"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/055\/13"},{"key":"ref12","volume":"12","author":"du","year":"2000","journal-title":"Combinatorial Group Testing and its Applications"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178156"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120391"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch4"},{"key":"ref17","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":"ref18","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1006\/jcta.1996.0012","article-title":"On r-cover-free families","volume":"73","author":"zolt\u00e1n","year":"1996","journal-title":"Journal of Combinatorial Theory Series A"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541824"},{"key":"ref4","first-page":"765","article-title":"Exact rule learning via boolean compressed sensing","author":"malioutov","year":"2013","journal-title":"International Conference on Machine Learning"},{"key":"ref27","first-page":"557","article-title":"Efficiently decodable errorcorrecting list disjunct matrices and applications","author":"ngo","year":"2011","journal-title":"Automata Languages and Programming"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2647600"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854218"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659619"},{"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":"Communication Control and Computing 2008 46th Annual Allerton Conference on"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_61"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00191-4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613870"},{"key":"ref42","article-title":"Biological screens from linear codes: theory and tools","author":"erlich","year":"2015","journal-title":"BioRxiv"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-3758(02)00148-9"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437557"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01104893"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.91"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10095"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"}],"event":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2018,10,2]]},"end":{"date-parts":[[2018,10,5]]}},"container-title":["2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8630872\/8635635\/08635972.pdf?arnumber=8635972","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T03:03:32Z","timestamp":1598238212000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8635972\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/allerton.2018.8635972","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}