{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T08:55:24Z","timestamp":1775120124051,"version":"3.50.1"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1109\/allerton.2009.5394826","type":"proceedings-article","created":{"date-parts":[[2010,1,26]],"date-time":"2010-01-26T12:35:50Z","timestamp":1264509350000},"page":"8-15","source":"Crossref","is-referenced-by-count":26,"title":["LP decoding meets LP decoding: A connection between channel coding and compressed sensing"],"prefix":"10.1109","author":[{"given":"Alexandros G.","family":"Dimakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal O.","family":"Vontobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","article-title":"On the iterative decoding of high rate LDPC codes with applications in compressed sensing","author":"zhang","year":"2009","journal-title":"submitted available online under"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797608"},{"key":"ref11","first-page":"3377","article-title":"Compressed sensing - probabilistic analysis of a null-space characterization","author":"stojnic","year":"2008","journal-title":"Proc IEEE Intern Conf Acoustics Speech and Signal Processing"},{"key":"ref12","article-title":"A simple proof for recoverability of $\\ell_{1}$-minimization: go over or under?","author":"zhang","year":"2005","journal-title":"Rice CAAM Department Technical Report TR05–09"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-006-1235-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.811926"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-08-00610-3"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924700"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2006.12.010"},{"key":"ref19","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref27","article-title":"Subspace pursuit for compressive sensing: closing the gap between performance and complexity","author":"dai","year":"2008","journal-title":"submitted available online under"},{"key":"ref3","author":"feldman","year":"2003","journal-title":"Decoding error-correcting codes via linear programming"},{"key":"ref6","article-title":"Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes","author":"vontobel","year":"2007","journal-title":"IEEE Trans Inform Theory available online under"},{"key":"ref29","article-title":"Euclidean sections with sublinear randomness and error-correction over the reals","author":"guruswami","year":"2008","journal-title":"Proc 12th Intern Workshop on Randomization and Computation"},{"key":"ref5","first-page":"75","article-title":"Graph covers and iterative decoding of finite-length codes","author":"koetter","year":"2003","journal-title":"Proc 3rd Intern Symp on Turbo Codes and Related Topics"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926452"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365106"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797639"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-1-4613-0165-3_5","article-title":"On the effective weights of pseudocodewords for codes defined on graphs with cycles","volume":"123","author":"forney","year":"2001","journal-title":"Codes Systems and Graphical Models (Minneapolis MN 1999)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205910"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907501"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536418"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887523"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523344"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313110"}],"event":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2009,9,30]]},"end":{"date-parts":[[2009,10,2]]}},"container-title":["2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5375733\/5394483\/05394826.pdf?arnumber=5394826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:06:38Z","timestamp":1497830798000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5394826\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/allerton.2009.5394826","relation":{},"subject":[],"published":{"date-parts":[[2009,9]]}}}