{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:05:23Z","timestamp":1742378723874,"version":"3.27.0"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/icc.2009.5199355","type":"proceedings-article","created":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T20:20:30Z","timestamp":1250022030000},"page":"1-6","source":"Crossref","is-referenced-by-count":4,"title":["Practical Dirty Paper Coding with Nested Binary LDGM-LDPC Codes"],"prefix":"10.1109","author":[{"given":"Q.","family":"Wang","sequence":"first","affiliation":[{"name":"Dept. of Electron. Eng., Shanghai Jiao Tong Univ., Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"He","sequence":"additional","affiliation":[{"name":"Dept. of Electron. Eng., Shanghai Jiao Tong Univ., Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/18.910579"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261737"},{"article-title":"low-density graph codes that are optimal for source\/channel coding and binning","year":"2007","author":"wainwright","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872985"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856935"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056659"},{"article-title":"design and analysis of ldgm-based codes for mse quantization","year":"2008","author":"wang","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523592"},{"key":"6","article-title":"analysis of ldgm and compound codes for lossy compression and binning","author":"martinian","year":"2006","journal-title":"Workshop on Information Theory and its Applications"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261737"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523319"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2007.302"},{"key":"8","article-title":"binary quantization using belief propagation with decimation over factor graphs of ldgm codes","author":"filler","year":"2007","journal-title":"Proc 45th Annual Allerton Conf"}],"event":{"name":"ICC 2009 - 2009 IEEE International Conference on Communications","start":{"date-parts":[[2009,6,14]]},"location":"Dresden, Germany","end":{"date-parts":[[2009,6,18]]}},"container-title":["2009 IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5198563\/5198564\/05199355.pdf?arnumber=5199355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T17:50:59Z","timestamp":1729101059000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5199355\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icc.2009.5199355","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}