{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:59:34Z","timestamp":1730278774449,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/itw.2005.1531867","type":"proceedings-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T15:48:27Z","timestamp":1132069707000},"page":"5 pp.","source":"Crossref","is-referenced-by-count":0,"title":["A note on a decoding algorithm of codes on graphs with small loops"],"prefix":"10.1109","author":[{"given":"N.","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Matsushima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Hirasawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961141"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"10","article-title":"A formalization of generalized probabilistic reasoning and its procedures on Junction trees","author":"matsushima","year":"0","journal-title":"IEEE Trans Inf Theory"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"7","article-title":"A note on decoding of low density parity-check codes with small-loop","author":"kobayashi","year":"2004","journal-title":"Int Symp on Information Theory and its Applications"},{"journal-title":"Artificial Intelligence","year":"1995","author":"russell","key":"6"},{"journal-title":"Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inferene","year":"1988","author":"pearl","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"9","article-title":"Cluster BP and cluster CCCP: Two simple methods for computing Kikuchi approximations","volume":"tr03 1","author":"sato","year":"2003","journal-title":"Tech Rep"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/18.825794"},{"journal-title":"Low Density Parity-check Codes and Its Decoding Algorithm (in Japanese)","year":"2002","author":"wadayama","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"}],"event":{"name":"IEEE Information Theory Workshop, 2005.","start":{"date-parts":[[2005,8,29]]},"location":"Rotorua, New Zealand","end":{"date-parts":[[2005,8,29]]}},"container-title":["IEEE Information Theory Workshop, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10256\/32676\/01531867.pdf?arnumber=1531867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T18:56:50Z","timestamp":1489517810000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1531867\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/itw.2005.1531867","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}