{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:13:36Z","timestamp":1761293616969,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006950","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"2353-2357","source":"Crossref","is-referenced-by-count":15,"title":["Improved bounds for universal one-bit compressive sensing"],"prefix":"10.1109","author":[{"given":"Jayadev","family":"Acharya","sequence":"first","affiliation":[]},{"given":"Arnab","family":"Bhattacharyya","sequence":"additional","affiliation":[]},{"given":"Pritish","family":"Kamath","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006950"},{"key":"ref31","first-page":"739","article-title":"Estimate of the number of signals in error correcting codes","volume":"117","author":"varshamov","year":"1957","journal-title":"Dokl A cad Nauk SSSR"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"key":"ref10","first-page":"820","article-title":"Efficient algorithms for robust one-bit compressive sensing","author":"zhang","year":"2014","journal-title":"ICML"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2527637"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.12.001"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.4208\/nmtma.2016.m1428"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1186\/s13634-016-0369-4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250824"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2011.5766202"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(82)90004-8"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0751-1_8"},{"key":"ref28","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":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5495766"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.0012"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558487"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"3868","DOI":"10.1109\/TSP.2012.2193397","article-title":"Robust 1-bit compressive sensing using adaptive outlier pursuit","volume":"60","author":"yan","year":"2012","journal-title":"IEEE Transactions on Signal Processing"},{"key":"ref29","first-page":"237","article-title":"Superimposed distance codes","volume":"18","author":"dyachkov","year":"1989","journal-title":"Problems Of Control And Information Theory-Problemy Upravlenlya I Teorii Informatsii"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513510"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2234823"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2207945"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref9","first-page":"154","article-title":"One-bit compressed sensing: Provable support and vector recovery","author":"gopi","year":"2013","journal-title":"Proceedings of The 30th InternationalConference on Machine Learning"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"journal-title":"Combinatorial Group Testing and Its Applications ser Applied Mathematics","year":"2000","author":"du","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178156"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/055\/13"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310477"},{"key":"ref23","article-title":"GROTESQUE: noisy group testing (quick and efficient)","volume":"abs 1307 2811","author":"cai","year":"2013","journal-title":"CoRR"},{"journal-title":"Efficient data structures from union-free families of sets","year":"2012","author":"de wolf","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613870"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006950.pdf?arnumber=8006950","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T18:20:40Z","timestamp":1570040440000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006950\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006950","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}