{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:33:08Z","timestamp":1648794788640},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00452-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"293-303","source":"Crossref","is-referenced-by-count":0,"title":["Bit-optimal decoding of codes whose Tanner graphs are trees"],"prefix":"10.1016","volume":"128","author":[{"given":"E","family":"Soljanin","sequence":"first","affiliation":[]},{"given":"E","family":"Offer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00452-3_BIB1","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/18.825794","article-title":"The generalized distributive law","volume":"46","author":"Aji","year":"2000","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00452-3_BIB2","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1109\/TIT.1979.1056035","article-title":"Replication decoding","volume":"25","author":"Battail","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00452-3_BIB3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","article-title":"Low-density parity-check codes","volume":"IT-8","author":"Gallager","year":"1962","journal-title":"IRE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00452-3_BIB4","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TIT.1976.1055617","article-title":"An optimum symbol by symbol decoding rule for linear codes","volume":"IT-22","author":"Hartmann","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00452-3_BIB5","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/18.910572","article-title":"Factor graphs and the sum-product algorithm","volume":"47","author":"Kschischang","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00452-3_BIB6","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1996"},{"key":"10.1016\/S0166-218X(02)00452-3_BIB7","doi-asserted-by":"crossref","unstructured":"E. Offer, E. Soljanin, An algebraic description of iterative decoding schemes, in: B. Marcus, J. Rosenthal (Eds.), Codes, Systems, and Graphical Models, IMA Volumes in Mathematics and its Applications, Vol. 123, Springer, Berlin, 2001.","DOI":"10.1007\/978-1-4613-0165-3_15"},{"key":"10.1016\/S0166-218X(02)00452-3_BIB8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(86)90072-X","article-title":"Fusion, propagation, and structuring in belief networks","volume":"29","author":"Pearl","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0166-218X(02)00452-3_BIB9","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1109\/18.910578","article-title":"Design of capacity-approaching irregular low-density parity-check codes","volume":"47","author":"Richardson","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00452-3_BIB10","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","article-title":"A recursive approach to low complexity codes","volume":"IT-27","author":"Tanner","year":"1981","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00452-3_BIB11","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1002\/ett.4460060507","article-title":"Codes and iterative decoding on general graphs","volume":"6","author":"Wiberg","year":"1995","journal-title":"European Trans. Telecommun."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004523?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004523?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T17:54:29Z","timestamp":1553450069000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02004523"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00452-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}