{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T21:10:34Z","timestamp":1740431434118,"version":"3.37.3"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513360","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T19:57:25Z","timestamp":1282247845000},"page":"1978-1982","source":"Crossref","is-referenced-by-count":2,"title":["Worst configurations (instantons) for Compressed Sensing over reals: A channel coding approach"],"prefix":"10.1109","author":[{"given":"Shashi Kiran","family":"Chilappagari","sequence":"first","affiliation":[]},{"given":"Michael","family":"Chertkov","sequence":"additional","affiliation":[]},{"given":"Bane","family":"Vasic","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394826"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"journal-title":"Probablisitic Reasoning in Intelligent Systems","year":"1988","author":"pearl","key":"ref12"},{"key":"ref13","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annual Allerton Conf on Communications Control and Computing"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.93.198702"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.95.228701"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917682"},{"key":"ref17","article-title":"Provably efficient instanton search algorithm for LP decoding of LDPC codes over the BSC","author":"chilappagari","year":"2008","journal-title":"IEEE Trans Inform Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205739"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2009.11.022"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304010"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797586"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025528"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20132"},{"key":"ref9","first-page":"30","article-title":"Explicit constructions for compressed sensing of sparse signals","author":"indyk","year":"2008","journal-title":"Proc 19th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"journal-title":"Compressive Sensing Resources","year":"0","key":"ref20"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the Lasso","volume":"58","author":"tibshirani","year":"1996","journal-title":"Journal of the Royal Statistical Society Series B"},{"journal-title":"l l-magic","year":"0","key":"ref21"},{"key":"ref24","article-title":"The power of convex relaxation: Near-optimal matrix completion","author":"candes","year":"2009","journal-title":"IEEE Trans Inform Theory"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"journal-title":"Subspace Pursuit for Compressive Sensing Signal Reconstruction","year":"2008","author":"dai","key":"ref26"},{"journal-title":"Sequential Compressed Sensing","year":"2009","author":"malioutov","key":"ref25"}],"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\/05513360.pdf?arnumber=5513360","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T20:33:40Z","timestamp":1740429220000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513360\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513360","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}