{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T17:52:49Z","timestamp":1772301169663,"version":"3.50.1"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"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":[[2010,3]]},"DOI":"10.1109\/tit.2009.2039160","type":"journal-article","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T21:09:58Z","timestamp":1268428198000},"page":"1351-1368","source":"Crossref","is-referenced-by-count":59,"title":["Lossy Source Compression Using Low-Density Generator Matrix Codes: Analysis and Algorithms"],"prefix":"10.1109","volume":"56","author":[{"given":"Martin J.","family":"Wainwright","sequence":"first","affiliation":[]},{"given":"Elitza","family":"Maneva","sequence":"additional","affiliation":[]},{"given":"Emin","family":"Martinian","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"11123","DOI":"10.1088\/0305-4470\/36\/43\/031","article-title":"one step rsb} scheme for the rate distortion function","volume":"65","author":"murayama","year":"2003","journal-title":"J Phys A Math Gen"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.035105"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815805"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261737"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261716"},{"key":"ref30","first-page":"153","article-title":"low density codes achieve the rate-distortion bound","volume":"1","author":"martinian","year":"2006","journal-title":"Proc Data Compress Conf"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref36","article-title":"random k-satisfiability: from an analytic solution to an efficient algorithm","volume":"66","author":"mzard","year":"2002","journal-title":"Phys Rev E"},{"key":"ref35","article-title":"alternative solutions to diluted p-spin models and xorsat problems","volume":"111","author":"mzard","year":"2002","journal-title":"J Statist Phys"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1126\/science.1073287"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548302005552"},{"key":"ref40","author":"pearl","year":"1988","journal-title":"Probabilistic Reasoning in Intelligent Systems"},{"key":"ref11","author":"dimakis","year":"2008","journal-title":"Lower Bounds on the Rate-Distortion Function of LDGM Codes"},{"key":"ref12","first-page":"769","article-title":"the 3-xorsat threshold","author":"dubois","year":"2002","journal-title":"Proc 42nd Annu Symp FOCS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref14","author":"filler","year":"2007","journal-title":"Minimizing Embedding Impact in Steganography Using Low Density Codes"},{"key":"ref15","article-title":"binary quantization using belief propagation with decimation over factor graphs of ldgm codes","author":"filler","year":"2007","journal-title":"Proc Allerton Conf Commun Contr Computing"},{"key":"ref16","first-page":"1","article-title":"practical methods for minimizing embedding impact in steganography","volume":"66","author":"fridrich","year":"2007","journal-title":"Proc SPIE Electron Imag"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity Check Codes"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2002.803484"},{"key":"ref19","author":"goblick","year":"1962","journal-title":"Coding for a discrete information source with a distortion measure"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/26.46532"},{"key":"ref4","author":"bertsekas","year":"1995","journal-title":"Nonlinear Programming"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1255443.1255445"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/26.539767"},{"key":"ref6","first-page":"10003p","article-title":"the theoretical capacity of the parity source coder","author":"ciliberti","year":"2006","journal-title":"J Stat Mechan"},{"key":"ref29","first-page":"229","article-title":"analysis of ldgm and compound codes for lossy compression and binning","author":"martinian","year":"2006","journal-title":"Proc Information Theory and Applications (ITA) Workshop"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.90.047205"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1159\/000094188"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref1","first-page":"947","article-title":"the threshold for random <formula formulatype=\"inline\"> <tex notation=\"tex\">$k$<\/tex><\/formula>-sat is <formula formulatype=\"inline\"> <tex notation=\"tex\">$2k \\log 2 - o(k)$<\/tex><\/formula>","volume":"17","author":"achlioptas","year":"2004","journal-title":"J AMSS"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523592"},{"key":"ref20","author":"grimmett","year":"1992","journal-title":"Probability and Random Processes"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055233"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313151"},{"key":"ref22","author":"hiriart-urruty","year":"1993","journal-title":"Convex Analysis and Minimization Algorithms Volume 1"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009815"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016040"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TURBOCODING.2008.4658729"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref43","first-page":"576","article-title":"ldpc codes can approach the slepian-wolf bound for general binary sources","author":"schonberg","year":"2002","journal-title":"Proc 40th Annu Allerton Conf Contr Commun Comput"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2004.1267047"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5429092\/05429117.pdf?arnumber=5429117","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:47:09Z","timestamp":1633913229000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5429117\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":48,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2039160","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}