{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T04:06:35Z","timestamp":1725681995757},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620778","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"3010-3014","source":"Crossref","is-referenced-by-count":5,"title":["Gallager B LDPC Decoder with Transient and permanent errors"],"prefix":"10.1109","author":[{"given":"Chu-Hsiang","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lara","family":"Dolecek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"0","author":"mackay","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620778"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858931"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.101712.121953"},{"key":"12","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839491"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1986.13535"},{"key":"1","first-page":"43","article-title":"Probabilistic logic and the synthesis of reliable organisms from unreliable components","author":"von neumann","year":"1956","journal-title":"Automata Studies"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.031213.120153"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2145870"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513786"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056763"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1968.tb01087.x"},{"key":"9","article-title":"Performance analysis of noisy message-passing decoding of low-density parity-check codes","author":"tarighati","year":"2010","journal-title":"IEEE IST"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483266"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620778.pdf?arnumber=6620778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T15:00:34Z","timestamp":1564498834000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620778\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620778","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}