{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T01:30:34Z","timestamp":1772328634579,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523488","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"1000-1004","source":"Crossref","is-referenced-by-count":15,"title":["Applications of sparse approximation in communications"],"prefix":"10.1109","author":[{"given":"A.C.","family":"Gilbert","sequence":"first","affiliation":[]},{"given":"J.A.","family":"Tropp","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2003.1246897"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1190\/1.1440921","article-title":"Deconvolution with the $\\cal l 1$ norm","volume":"1","author":"taylor","year":"1979","journal-title":"Geophysics"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1162\/089976698300017269"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304010"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref16","article-title":"Approximation of functions over redundant dictionaries using coherence","author":"gilbert","year":"2003","journal-title":"ACM-SIAM Annu Symp Discrete Algorithms"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834793"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.959265"},{"key":"ref19","article-title":"Optimally sparse representation in general (non-orthogonal) dictionaries via $\\cal l 1$ minimization","author":"donoho","year":"2002","journal-title":"DRAFT"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.312154"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"ref27","article-title":"The Theory of Error-Correcting Codes","author":"macwilliams","year":"1977"},{"key":"ref3","article-title":"Nonlinear methods of approximation","author":"temlyakov","year":"2002","journal-title":"Foundations of Computational Math"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s003659900046"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02678430"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2002.806592"},{"key":"ref7","author":"zhang","year":"1993","journal-title":"Matching pursuit"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492900002816"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2003.821105"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1201\/9781420035933","article-title":"Subset selection in regression","author":"miller","year":"2002"},{"key":"ref20","article-title":"Just relax: Convex programming methods for subset selection and sparse approximation","author":"tropp","year":"2004","journal-title":"ICES Report 04–04 The University of Texas at Austin"},{"key":"ref22","article-title":"For most large underdetermined systems of linear equations, the minimal l1-norm solution is the sparsest","author":"donoho","year":"2004"},{"key":"ref21","article-title":"For most large underdetermined systems of linear equations, the minimal l1-norm near-solution approximates the sparsest","author":"donoho","year":"2004"},{"key":"ref24","article-title":"Simultaneous approximation by greedy algorithms","author":"leviatan","year":"2003","journal-title":"IMI Report 2003 02 Univ of South Carolina at Columbia"},{"key":"ref23","article-title":"Algorithms for simultaneous sparse approximation part i: Greedy pursuit","author":"tropp","year":"2004","journal-title":"submitted"},{"key":"ref26","article-title":"private communication","author":"huo","year":"2005"},{"key":"ref25","article-title":"Simultaneous approximation by greedy pursuit","author":"tropp","year":"2005","journal-title":"ICASSP 2005"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","location":"Adelaide, Australia","start":{"date-parts":[[2005,9,4]]},"end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523488.pdf?arnumber=1523488","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T10:08:27Z","timestamp":1497694107000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523488\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523488","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}