{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:32:26Z","timestamp":1774679546011,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2010,5,1]],"date-time":"2010-05-01T00:00:00Z","timestamp":1272672000000},"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,5]]},"DOI":"10.1109\/tit.2010.2043781","type":"journal-article","created":{"date-parts":[[2010,4,26]],"date-time":"2010-04-26T17:35:55Z","timestamp":1272303355000},"page":"2143-2167","source":"Crossref","is-referenced-by-count":28,"title":["Hash property and coding theorems for sparse matrices and maximum-likelihood coding"],"prefix":"10.1109","volume":"56","author":[{"given":"Jun","family":"Muramatsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeki","family":"Miyake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"53","author":"wadayama","year":"2003","journal-title":"A lossy compression algorithm for binary memoryless sources based on LDPC codes"},{"key":"ref38","first-page":"98","article-title":"a lossy compression algorithm for discrete memoryless sources based on ldpc codes","author":"wadayama","year":"2003","journal-title":"Proc 3rd Asian-Eur Workshop Inf Theory"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.7.2036"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855604"},{"key":"ref31","author":"muramatsu","year":"2009","journal-title":"Construction of codes for wiretap channel and secret key agreement from correlated source outputs by using sparse matrices"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046214"},{"key":"ref37","author":"uyematsu","year":"1998","journal-title":"Gendai Shannon Riron"},{"key":"ref36","first-page":"142","article-title":"coding theorems for a discrete source with a fidelity criterion","author":"shannon","year":"1959","journal-title":"IRE National Convention Record Part 4"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.035105"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846431"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055107"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref12","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref13","first-page":"19","article-title":"coding for channel with random parameters","volume":"9","author":"gel'fand","year":"1983","journal-title":"Probl Inform Transm (Probl Pered Inform )"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016040"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.42171"},{"key":"ref16","author":"han","year":"2002","journal-title":"Mathematics of Information and Coding"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.903113"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref19","author":"kudekar","year":"2007","journal-title":"Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E92.A.2333"},{"key":"ref4","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e91-a.6.1488"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055356"},{"key":"ref6","author":"csiszr","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref29","first-page":"1","author":"muramatsu","year":"2007","journal-title":"Lossy source coding algorithm using lossless multi-terminal source codes"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056524"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313151"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824917"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2307\/2319442"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.825794"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003821"},{"key":"ref22","first-page":"153","article-title":"low density codes achieve the rate-distortion bound","author":"martinian","year":"2006","journal-title":"Proc IEEE Data Compression Conf"},{"key":"ref21","author":"mackay","year":"2003","journal-title":"Information Theory Inference and Learning Algorithms"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055107"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815805"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055171"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261716"},{"key":"ref44","author":"yeung","year":"2006","journal-title":"A First Course in Information Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261726"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.959254"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5452181\/05452198.pdf?arnumber=5452198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:01:01Z","timestamp":1633914061000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5452198\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":45,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2043781","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5]]}}}