{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T03:07:31Z","timestamp":1648696051549},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s00354-008-0069-1","type":"journal-article","created":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T15:23:28Z","timestamp":1257348208000},"page":"347-363","source":"Crossref","is-referenced-by-count":0,"title":["Decoding Algorithm of Low-density Parity-check Codes based on Bowman-Levin Approximation"],"prefix":"10.1007","volume":"27","author":[{"given":"Ken-ichi","family":"Tamura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miho","family":"Komiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masato","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiyuki","family":"Kabashima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,11,5]]},"reference":[{"key":"69_CR1","unstructured":"Pearl, J., Probabilistic Reasoning in Intelligent Systems, Morgan Kaufmann, 1988."},{"key":"69_CR2","doi-asserted-by":"crossref","first-page":"1691","DOI":"10.1162\/08997660260028674","volume":"14","author":"L. Yuille A.","year":"2002","unstructured":"Yuille, A. L., \u201cCCCP Algorithm to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation,\u201d Neural Comput., 14, pp. 1691\u20131722, 2002.","journal-title":"Neural Comput."},{"key":"69_CR3","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1209\/epl\/i1998-00524-7","volume":"44","author":"Y. Kabashima","year":"1998","unstructured":"Kabashima, Y. and Saad, D., \u201cBelief propagation vs. TAP for decoding corrupted messages,\u201d Europhys. Lett., 44, pp. 668\u2013674, 1998.","journal-title":"TAP for decoding corrupted messages\u201d. Europhys. Lett.,"},{"key":"69_CR4","unstructured":"Yedidia, J. S. and Freeman, W. T. and Weiss, Y., \u201cBethe free energy, Kikuchi approximations, and belief propagation algorithms,\u201d http:\/\/www.merl.com , Mitsubishi Research Laboratories, 2001."},{"key":"69_CR5","doi-asserted-by":"crossref","unstructured":"Gallager, R. G., Low-Density Parity-Check Codes, Research Monograph series, Cambridge, MIT Press, 1963.","DOI":"10.7551\/mitpress\/4347.001.0001"},{"issue":"2","key":"69_CR6","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"D. J. C. MacKay","year":"1999","unstructured":"MacKay, D. J. C., \u201cGood error-correcting codes based on very sparse matrices,\u201d IEEE Trans. Inform. Theory, 45, 2, pp. 399\u2013431, 1999.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"69_CR7","first-page":"2601","volume":"10","author":"T. Shibuya","year":"2003","unstructured":"Shibuya, T. and Sakaniwa, K., \u201cPerformance of a Decoding Algorithm for LDPC Codes Based on the Concave-Convex Procedure,\u201d IEICE Trans. on Fundamentals, E86-A, 10, pp. 2601\u20132606, 2003.","journal-title":"IEICE Trans. on Fundamentals, E86-A"},{"issue":"5","key":"69_CR8","doi-asserted-by":"crossref","first-page":"3438","DOI":"10.1103\/PhysRevB.25.3438","volume":"25","author":"R. Bowman D.","year":"1982","unstructured":"Bowman, D. R. and Levin, K., \u201cSpin-glass theory in the Bethe approximation: Insights and problems,\u201d Phys. Rev. B, 25, 5, pp. 3438\u20133441, 1982.","journal-title":"Phys. Rev. B"},{"issue":"2","key":"69_CR9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1162\/089976698300017746","volume":"10","author":"S. Amari","year":"1998","unstructured":"Amari, S., \u201cNatural Gradient Works Efficiently in Learning,\u201d Neural Comput., 10, 2, pp. 251\u2013276, 1998.","journal-title":"Neural Comput."},{"issue":"1","key":"69_CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4036\/iis.2007.57","volume":"13","author":"Y. Tonosaki","year":"2007","unstructured":"Tonosaki, Y. and Kabashima, Y., \u201cSequential Minimization of the Bethe Free Energy of Ising Spin Systems,\u201d Interdisciplinary Information Sciences, 13, 1, pp. 57\u201364, 2007.","journal-title":"Interdisciplinary Information Sciences"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-008-0069-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00354-008-0069-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-008-0069-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:27:50Z","timestamp":1559053670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00354-008-0069-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["69"],"URL":"https:\/\/doi.org\/10.1007\/s00354-008-0069-1","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}