{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:49:29Z","timestamp":1774680569446,"version":"3.50.1"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/tit.2017.2750178","type":"journal-article","created":{"date-parts":[[2017,9,11]],"date-time":"2017-09-11T14:14:40Z","timestamp":1505139280000},"page":"7304-7319","source":"Crossref","is-referenced-by-count":6,"title":["$\\epsilon $ -Almost Selectors and Their Applications to Multiple-Access Communication"],"prefix":"10.1109","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8792-4799","authenticated-orcid":false,"given":"Annalisa","family":"De Bonis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4085-7300","authenticated-orcid":false,"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","author":"mazumdar","year":"2015","journal-title":"Nonadaptive group testing with random set of defectives via constant-weight codes"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35261-4_67"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057010"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90058-8"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(94)90067-1"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2163296"},{"key":"ref34","first-page":"572","article-title":"Partial covering of hypergraphs","author":"s\u00fcmer","year":"2005","journal-title":"Proc 17th Ann ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0013-1_11"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.03.001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22012-8_49"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(02)00004-4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00851-4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90009-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844097"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703428002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00281-0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881740"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178156"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.03.033"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300004521"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946013040017"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057020"},{"key":"ref5","author":"barg","year":"2015","journal-title":"Almost disjunct matrices from codes and designs"},{"key":"ref8","author":"bollob\u00e1s","year":"1986","journal-title":"Combinatorics Set Systems Hypergraphs Families of Vectors and Combinatorial Probability"},{"key":"ref7","volume":"10","author":"biglieri","year":"2007","journal-title":"NATO Security Through Science Series—D Information and Communication Security"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480103431071"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310477"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2314472"},{"key":"ref20","author":"du","year":"2000","journal-title":"Combinatorial Group Testing and its Applications"},{"key":"ref22","first-page":"7","article-title":"Bounds on the length of disjunct codes","volume":"17","author":"d\u2019yachkov","year":"1982","journal-title":"Problemy Peredachi Inf"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1142\/6122","volume":"18","author":"du","year":"2006","journal-title":"Pooling Design and Nonadaptive Group Testing"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF02772959"},{"key":"ref23","author":"d\u2019yachkov","year":"2014","journal-title":"Almost cover-free codes and designs"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073843"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.0012"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8071168\/08031347.pdf?arnumber=8031347","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:39Z","timestamp":1641987579000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8031347\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":36,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2750178","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11]]}}}