{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T17:52:38Z","timestamp":1772301158300,"version":"3.50.1"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2009,3,1]],"date-time":"2009-03-01T00:00:00Z","timestamp":1235865600000},"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":[[2009,3]]},"DOI":"10.1109\/tit.2008.2009815","type":"journal-article","created":{"date-parts":[[2009,2,26]],"date-time":"2009-02-26T18:05:02Z","timestamp":1235671502000},"page":"1061-1079","source":"Crossref","is-referenced-by-count":38,"title":["Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information"],"prefix":"10.1109","volume":"55","author":[{"given":"Martin J.","family":"Wainwright","sequence":"first","affiliation":[]},{"given":"Emin","family":"Martinian","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.035105"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref33","first-page":"153","article-title":"low density codes achieve the rate-distortion bound","volume":"1","author":"martinian","year":"2006","journal-title":"Proc Data Compression Conf"},{"key":"ref32","first-page":"229","article-title":"analysis of ldgm and compound codes for lossy compression and binning","author":"martinian","year":"2006","journal-title":"Proc Workshop Inf Theory Appl"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/26.46532"},{"key":"ref30","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60693-9_13","article-title":"good codes based on very sparse matrices","author":"mackay","year":"1995","journal-title":"Proc 5th IMA Conf Cryptography and Coding"},{"key":"ref37","first-page":"111:105","article-title":"alternative solutions to diluted p-spin models and problems","author":"mzard","year":"2002","journal-title":"J Statist Phys"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815805"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261737"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261716"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2004.1267047"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2003.1247033"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.810639"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2002.803484"},{"key":"ref22","author":"grimmett","year":"1992","journal-title":"Probability and Random Processes"},{"key":"ref21","first-page":"19","article-title":"coding for channel with random parameters","volume":"9","author":"gelfand","year":"1983","journal-title":"Probl Pered Inf (Probl Inf Transmission)"},{"key":"ref24","article-title":"capacity-achieving codes with bounded graphical complexity on noisy channels","author":"hsu","year":"2005","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref23","volume":"1","author":"hiriart-urruty","year":"1993","journal-title":"Convex Analysis and Minimization Algorithms"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.992777"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.83.2660"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055233"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523592"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003821"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2005.61"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.889606"},{"key":"ref10","author":"ciliberti","year":"2005","journal-title":"Message-passing algorithms for non-linear nodes and data compression"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.90.047205"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.62.1577"},{"key":"ref12","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","author":"cover","year":"1991","journal-title":"Elements of Information Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548302005552"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","author":"devroye","year":"1996","journal-title":"A Probabilistic Theory of Pattern Recognition"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313151"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1182002"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855586"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872855"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity Check Codes"},{"key":"ref4","author":"bertsekas","year":"1995","journal-title":"Nonlinear Programming"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/26.539767"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2001.986929"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.801408"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2003.1193994"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523319"},{"key":"ref9","author":"ciliberti","year":"2005","journal-title":"The theoretical capacity of the parity source coder"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref47","first-page":"576","article-title":"ldpc codes can approach the slepian-wolf bound for general binary sources","author":"schonberg","year":"2002","journal-title":"Proc Ann Allerton Conf Commun Control and Computing"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896873"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/36\/43\/031"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.808103"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850079"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4787592\/04787613.pdf?arnumber=4787613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:59:56Z","timestamp":1633910396000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4787613\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":55,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2008.2009815","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}