{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T14:56:29Z","timestamp":1784645789938,"version":"3.55.0"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61571467"],"award-info":[{"award-number":["61571467"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2899106","type":"journal-article","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T20:15:43Z","timestamp":1550088943000},"page":"23656-23666","source":"Crossref","is-referenced-by-count":20,"title":["Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8342-2246","authenticated-orcid":false,"given":"Huilian","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaoping","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SIPS.2004.1363033"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.841982"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2010.2046964"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.158"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.101910.070303"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2444381"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2717405"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2349943"},{"key":"ref18","first-page":"165","article-title":"Residual belief propagation: Informed scheduling for asynchronous message passing","author":"elidan","year":"2006","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1049\/el:20092505"},{"key":"ref4","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annu Allerton Conf Commun Control Comput"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.101210.090628"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.070325"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2401554"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.071813.120659"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1049\/el:19970362"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.012313.120172"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.072011.100438"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2527642"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2385096"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2615016"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2732950"},{"key":"ref26","first-page":"1","year":"2009"},{"key":"ref25","first-page":"1036e","article-title":"Efficient implementations of the sum-product algorithm for decoding LDPC codes","author":"hu","year":"2001","journal-title":"Proc IEEE Globecom"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08641399.pdf?arnumber=8641399","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T07:12:56Z","timestamp":1643267576000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8641399\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2899106","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}