{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T10:44:26Z","timestamp":1743849866478,"version":"3.28.0"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513435","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T15:57:25Z","timestamp":1282233445000},"page":"1593-1597","source":"Crossref","is-referenced-by-count":9,"title":["Recovery thresholds for ℓ<inf>1<\/inf> optimization in binary compressed sensing"],"prefix":"10.1109","author":[{"given":"Mihailo","family":"Stojnic","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797608"},{"key":"ref32","article-title":"Sharp thresholds for high-dimensional and noisy recovery of sparsity","author":"wainwright","year":"2006","journal-title":"Proc Allerton Conference on Communication Control and Computing"},{"key":"ref31","article-title":"On sparse recovery of compressed dna microarrays","author":"vikalo","year":"2007","journal-title":"Asilomor conference"},{"key":"ref30","article-title":"Joint-sparse recovery from multiple measurements","author":"van den berg","year":"2009","journal-title":"arXiv 0904 2051"},{"key":"ref35","article-title":"A simple proof for recoverability of ell-1-minimization (ii): the nonnegative case","author":"zhang","year":"2005","journal-title":"Technical Report TR05–10"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2008.920605"},{"key":"ref10","article-title":"Thresholds for the recovery of sparse solutions via $l_{1}$ minimization","author":"donoho","year":"2006","journal-title":"Proc Conf on Information Sciences and Systems"},{"journal-title":"Counting the face of randomly projected hypercubes and orthants with application","year":"2008","author":"donoho","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.959265"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914730"},{"key":"ref14","article-title":"Robust recovery of signals from a structured union of subspaces","author":"eldar","year":"2008","journal-title":"arXiv 0807 4581"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4960290"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0081737"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820031"},{"key":"ref18","article-title":"Sparse recovery of positive signals with minimal expansion Preprint","author":"khajehnejad","year":"2009","journal-title":"arXiv 0902 4045"},{"key":"ref19","article-title":"Uniqueness of integer solution of linear equations","author":"mangasarian","year":"2009","journal-title":"Data Mining Institute Technical Report 09-01"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2020754"},{"key":"ref4","article-title":"Compressed sensing and best k-term approximation","volume":"22","author":"cohen","year":"2009","journal-title":"Journal of the American Mathematical Society"},{"key":"ref27","article-title":"Various thresholds for $\\ell_{1}$ -optimization in compressed sensing","author":"stojnic","year":"2009","journal-title":"arXiv 0907 3666"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016024"},{"key":"ref29","article-title":"Algorithms for simultaneous sparse approximation. part i: Greedy pursuit","author":"tropp","year":"2005","journal-title":"Signal Processing"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/26.990897"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-005-1220-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-007-0008-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040894"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0502269102"},{"key":"ref20","article-title":"Probability of unique integer solution to a syatem of linear equations","author":"mangasarian","year":"2009","journal-title":"Technical Report 02–02–01"},{"journal-title":"Guaranteed minimum-rank solution of linear matrix equations via nuclear norm minimization","year":"2007","author":"recht","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2008.924384"},{"key":"ref24","article-title":"On sparse reconstruction from Fourier and Gaussian measurements","volume":"61","author":"rudelson","year":"2007","journal-title":"Comm on Pure and Applied Math"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914729"},{"key":"ref26","article-title":"A simple performance analysis of $\\ell_{1}$ -optimization in compressed sensing","author":"stojnic","year":"2009","journal-title":"Proc ICASSP Int Conf Acoustic Speech Signal Processing"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176342412"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513435.pdf?arnumber=5513435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T16:24:30Z","timestamp":1489854270000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513435\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513435","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}