{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:41:22Z","timestamp":1729676482862,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034217","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"678-682","source":"Crossref","is-referenced-by-count":3,"title":["General constructions of deterministic (S)RIP matrices for compressive sampling"],"prefix":"10.1109","author":[{"given":"Arya","family":"Mazumdar","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Barg","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2007.09.001"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1007\/978-3-540-70575-8_61","article-title":"Explicit Non-Adaptive Combinatorial Group Testing Schemes","author":"porat","year":"2008","journal-title":"Proc 34th Int'l Colloquium Automata Languages and Programming (ICALP)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2043161"},{"journal-title":"A sublinear algorithm for sparse reconstruction with l1\/l2 recovery guarantees arXiv 0806 3799v2","year":"0","author":"calderbank","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS653"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2016-7","author":"conway","year":"1988","journal-title":"Sphere Packings Lattices and Groups"},{"journal-title":"Structured sublinear compressive sensing via dense belief propagation arXiv 1101 3348","year":"0","author":"dai","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2007.04.002"},{"journal-title":"The statistical restricted isometry property and the Wigner semicircle distribution of incoherent dictionaries arXiv 0903 3627","year":"0","author":"gurevich","key":"ref19"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.08.002"},{"journal-title":"Orthogonal symmetric Toeplitz matrices for compressed sensing statistical isometry property arxiv 1012 5947","year":"2010","author":"li","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"ref6","article-title":"Random frames from binary linear codes","author":"babadi","year":"0","journal-title":"Proc 44th Annual Conf Inform Sciences and Systems (CISS 2010)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205667"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.95"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.44"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513359"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030308"},{"journal-title":"Explicit constructions of RIP matrices and related problems arXiv 1008 4535","year":"0","author":"bourgain","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-008-9110-x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9043-z"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"ref21","first-page":"353","article-title":"Almost Euclidean sections of $L_{1}^{N}$ via expander codes","author":"guruswami","year":"2008","journal-title":"Proc ACM-SIAM Symposium on Discrete Algorithms 1998"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1134\/S0001434607110193"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2009.5054839"},{"key":"ref26","first-page":"1303","article-title":"Bounds on the maximum cardinality of codes with a bounded modulus of the scalar product","volume":"263","author":"levenshtein","year":"1982","journal-title":"Soviet Mathematics Doklady"},{"journal-title":"Linear Algebra","year":"1997","author":"lax","key":"ref25"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034217.pdf?arnumber=6034217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:20:43Z","timestamp":1560730843000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034217\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034217","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}