{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:43:44Z","timestamp":1730274224670,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1109\/isit.2008.4595021","type":"proceedings-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T22:33:52Z","timestamp":1218666832000},"page":"424-428","source":"Crossref","is-referenced-by-count":2,"title":["Hash property and Wyner-Ziv source coding by using sparse matrices and maximum-likelihood coding"],"prefix":"10.1109","author":[{"family":"Jun Muramatsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Shigeki Miyake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.7.2036"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043781"},{"year":"0","key":"23"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855604"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261726"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2008.4895482"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/18.959254"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557371"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261716"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815805"},{"key":"21","first-page":"142","article-title":"coding theorems for a discrete source with a fidelity criterion","volume":"4","author":"shannon","year":"1959","journal-title":"IRE Nat Convention Record"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056524"},{"year":"0","key":"20"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055356"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824917"},{"key":"10","first-page":"153","article-title":"low density codes achieve the ratedistortion bound","author":"martinian","year":"2006","journal-title":"Proc of the IEEE Data Compression Coference"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.903113"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846431"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"journal-title":"Information Theory Inference and Learning Algorithms","year":"2003","author":"mackay","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"}],"event":{"name":"2008 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2008,7,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2008,7,11]]}},"container-title":["2008 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4586217\/4594928\/04595021.pdf?arnumber=4595021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T18:40:09Z","timestamp":1489689609000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4595021\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit.2008.4595021","relation":{},"subject":[],"published":{"date-parts":[[2008,7]]}}}