{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:43:19Z","timestamp":1778647399388,"version":"3.51.4"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437557","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"1101-1105","source":"Crossref","is-referenced-by-count":9,"title":["Energy-limited Massive Random Access via Noisy Group Testing"],"prefix":"10.1109","author":[{"given":"Huseyin A.","family":"Inan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Kairouz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayfer","family":"Ozgur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310477"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852259"},{"key":"ref13","first-page":"791","article-title":"Neighbor discovery in wireless ad hoc networks based on group testing","author":"luo","year":"2008","journal-title":"Allerton"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006984"},{"key":"ref15","article-title":"Lectures on designing screening experiments","volume":"abs 1401 7505","author":"d'yachkov","year":"2014","journal-title":"CoRR"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659619"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.556668"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541824"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178156"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707018"},{"key":"ref6","first-page":"7","article-title":"Bounds on the length of disjunctive codes","volume":"18","author":"d'yachkov","year":"1982","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref5","article-title":"Combinatorial group testing and its applications","volume":"12","author":"du","year":"2000","journal-title":"World Scientific"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_61"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"ref2","article-title":"Sparse Combinatorial Group Testing for Low-Energy Massive Random Access","author":"inan","year":"2017","journal-title":"ArXiv e-prints"},{"key":"ref1","author":"sparksr","year":"2017","journal-title":"White paper The economics of a trillion connected devices"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.91"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","location":"Vail, CO, USA","start":{"date-parts":[[2018,6,17]]},"end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437557.pdf?arnumber=8437557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:42:46Z","timestamp":1598229766000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437557\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437557","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}