{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T09:48:18Z","timestamp":1776073698770,"version":"3.50.1"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T00:00:00Z","timestamp":1335830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1109\/tit.2011.2181819","type":"journal-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T19:11:57Z","timestamp":1328037117000},"page":"3093-3114","source":"Crossref","is-referenced-by-count":119,"title":["LDPC Codes for Compressed Sensing"],"prefix":"10.1109","volume":"58","author":[{"given":"Alexandros G.","family":"Dimakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roxana","family":"Smarandache","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal O.","family":"Vontobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/ALLERTON.2008.4797558","article-title":"Counter braids: Asymptotic optimality of the message passing decoding algorithm","author":"lu","year":"2008","journal-title":"Proc 46th Allerton Conf Commun Control Comput"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523344"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025528"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313110"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205910"},{"key":"ref37","article-title":"On the iterative decoding of high rate LDPC codes with applications in compressed sensing","author":"zhang","year":"0","journal-title":"IEEE Trans Inf Theory"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034170"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2043161"},{"key":"ref62","doi-asserted-by":"crossref","first-page":"2145","DOI":"10.1214\/08-AOS653","article-title":"Near-ideal model selection by <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$\\ell_{1}$<\/tex><\/formula> minimization","volume":"37","author":"cands","year":"2009","journal-title":"Ann Statist"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2137330"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032726"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-1-4613-0165-3_5","volume":"123","author":"forney jr","year":"2001","journal-title":"Codes Systems and Graphical Models (Minneapolis MN 1999)"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2082536"},{"key":"ref27","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2049997"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907501"},{"key":"ref2","article-title":"Channel coding LP decoding and compressed sensing LP decoding: Further connections","author":"dimakis","year":"2010","journal-title":"Proc 2010 Int Zrich Seminar Commun"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394826"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-006-1235-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-08-00610-3"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.811926"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924700"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2006.12.010"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1994.394711"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375608"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2006.1633805"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.914344"},{"key":"ref58","article-title":"Euclidean sections with sublinear randomness and error-correction over the reals","author":"guruswami","year":"2008","journal-title":"Proc 12th Int Workshop Random Comput"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016006"},{"key":"ref56","author":"lin","year":"2004","journal-title":"Error Control Coding"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460090308"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264715"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1006\/aima.1996.0050"},{"key":"ref52","volume":"56","author":"massey","year":"1977","journal-title":"Algebraic Topology An Introduction"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926452"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797639"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887523"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536418"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/090748160"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797608"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2008.4518375"},{"key":"ref19","author":"zhang","year":"2005","journal-title":"A Simple Proof for Recoverability of -Minimization Go Over or Under?"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref5","author":"feldman","year":"2003","journal-title":"Decoding error-correcting codes via linear programming"},{"key":"ref8","article-title":"Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes","author":"vontobel","year":"2005","journal-title":"CoRR"},{"key":"ref7","first-page":"75","article-title":"Graph covers and iterative decoding of finite-length codes","author":"koetter","year":"2003","journal-title":"Proc 3rd Int Symp Turbo Codes Related Topics"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-007-9003-x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365106"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.38"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510003"},{"key":"ref48","author":"chandar","year":"2008","journal-title":"A Negative Result Concerning Explicit Matrices with the Restricted Isometry Property"},{"key":"ref47","article-title":"On the block error probability of LP decoding of LDPC codes","author":"koetter","year":"2006","journal-title":"Proc Inaugural Workshop Center Inf Theory Appl"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2010.6388466"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454077"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2045092"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2007.04.002"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6185725\/06135505.pdf?arnumber=6135505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:44Z","timestamp":1633909964000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6135505\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":65,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2181819","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5]]}}}