{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T18:06:29Z","timestamp":1729620389628,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/itw.2006.1633825","type":"proceedings-article","created":{"date-parts":[[2006,5,25]],"date-time":"2006-05-25T16:26:01Z","timestamp":1148574361000},"page":"263-264","source":"Crossref","is-referenced-by-count":2,"title":["Low-density constructions for lossy compression, binning, and coding with side information"],"prefix":"10.1109","author":[{"given":"E.","family":"Martinian","sequence":"first","affiliation":[]},{"given":"M.J.","family":"Wainwright","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055233"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523592"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.810622"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"13","first-page":"66","article-title":"Random k-satisfiability: From an analytic solution to an efficient algorithm","author":"mezard","year":"2002","journal-title":"Phys Rev E"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.035105"},{"journal-title":"Low Density Codes Can Achieve the Wyner-Ziv and Gelfand-Pinsker Bounds","year":"2006","author":"martinian","key":"11"},{"key":"12","article-title":"Iterative quantization using codes on graphs","author":"martinian","year":"2003","journal-title":"Allerton Conference on Communication Control and Computing"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003821"},{"journal-title":"The theoretical capacity of the parity source coder","year":"2005","author":"ciliberti","key":"3"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2005.61"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2003.1193994"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.810639"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.1109\/DCC.2006.44","article-title":"Low density codes achieve the rate-distortion bound","volume":"1","author":"martinian","year":"2006","journal-title":"Data Compression Conference"},{"key":"7","first-page":"19","article-title":"Coding for channel with random parameters","volume":"9","author":"gelfand","year":"1983","journal-title":"Probl Inf Tranmission"},{"key":"6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity Check Codes"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855586"},{"journal-title":"Message-passing algorithms for non-linear nodes and data compression","year":"2005","author":"ciliberti","key":"4"},{"key":"9","article-title":"Analysis of low-density generator matrix codes and extensions","author":"martinian","year":"2006","journal-title":"UCSD Workshop on Information Theory and Its Applications"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/26.46532"}],"event":{"name":"2006 IEEE Information Theory Workshop","location":"Punta del Este, Uruguay"},"container-title":["2006 IEEE Information Theory Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10885\/34255\/01633825.pdf?arnumber=1633825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T20:50:31Z","timestamp":1555620631000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1633825\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/itw.2006.1633825","relation":{},"subject":[]}}