{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T14:51:09Z","timestamp":1780671069736,"version":"3.54.1"},"reference-count":17,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2025,6,1]]},"DOI":"10.1587\/transfun.2024eal2080","type":"journal-article","created":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T22:14:04Z","timestamp":1734560044000},"page":"878-882","source":"Crossref","is-referenced-by-count":1,"title":["Reliability-List-Based Check-Belief Propagation Decoding of LDPC Codes"],"prefix":"10.1587","volume":"E108.A","author":[{"given":"Zhe","family":"LIU","sequence":"first","affiliation":[{"name":"School of Integrated Circuits, Beijing University of Posts and Telecommunications"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wu","family":"GUAN","sequence":"additional","affiliation":[{"name":"School of Integrated Circuits, Beijing University of Posts and Telecommunications"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ziqin","family":"YAN","sequence":"additional","affiliation":[{"name":"School of Integrated Circuits, Beijing University of Posts and Telecommunications"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liping","family":"LIANG","sequence":"additional","affiliation":[{"name":"School of Integrated Circuits, Beijing University of Posts and Telecommunications"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] N. Wiberg, H. Loeliger, and R. Kotter, \u201cCodes and iterative decoding on general graphs,\u201d European Transactions on Telecommunications, vol.6, no.5, pp.513-525, 1995. 10.1002\/ett.4460060507","DOI":"10.1002\/ett.4460060507"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] D.J. MacKay and R.M. Neal, \u201cNear Shannon limit performance of low density parity check codes,\u201d Electronics Letters, vol.33, no.6, pp.457-458 1997. 10.1049\/el:19970362","DOI":"10.1049\/el:19970362"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] J. Zhao, F. Zarkeshvari, and A.H. Banihashemi, \u201cOn implementation of min-sum algorithm and its modifications for decoding low-density parity-check (LDPC) codes,\u201d IEEE Trans. Commun., vol.53, no.4, pp.549-554, 2005. 10.1109\/tcomm.2004.836563","DOI":"10.1109\/TCOMM.2004.836563"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] J. Chen, A. Dholakia, E. Eleftheriou, M.P. Fossorier, and X.Y. Hu, \u201cReduced-complexity decoding of LDPC codes,\u201d IEEE Trans. Commun., vol.53, no.8, pp.1288-1299, 2005. 10.1109\/tcomm.2005.852852","DOI":"10.1109\/TCOMM.2005.852852"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] J. Zhang and M. Fossorier, \u201cShuffled belief propagation decoding,\u201d Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002, Pacific Grove, CA, USA, vol.1, pp.8-15, 2002, doi: 10.1109\/ACSSC.2002.1197141. 10.1109\/acssc.2002.1197141","DOI":"10.1109\/ACSSC.2002.1197141"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] D.E. Hocevar, \u201cA reduced complexity decoder architecture via layered decoding of LDPC codes,\u201d IEEE Workshop on Signal Processing Systems, 2004, SIPS 2004, pp.107-112, 2004. 10.1109\/sips.2004.1363033","DOI":"10.1109\/SIPS.2004.1363033"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] H. Li, H. Ding, L. Zheng, Z. Lei, H. Xiong, and T. Wang, \u201cAn efficient scheduling scheme for layered belief propagation decoding of regular LDPC codes,\u201d 2016 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), pp.397-400, Oct. 2016. 10.1109\/ICUMT.2016.7765392","DOI":"10.1109\/ICUMT.2016.7765392"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] A.I.V. Casado, M. Griot, and R.D. Wesel, \u201cInformed dynamic scheduling for belief-propagation decoding of LDPC codes,\u201d 2007 IEEE International Conference on Communications, pp.932-937, June 2007. 10.1109\/icc.2007.158","DOI":"10.1109\/ICC.2007.158"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] D.-D. Yan, X.-K. Fan, Z.-Y. Chen, and H.-Y. Ma, \u201cLow-loss belief propagation decoder with Tanner graph in quantum error-correction codes,\u201d Chinese Physics B, vol.31, no.1, 010304, 2022. 10.1088\/1674-1056\/ac11cf","DOI":"10.1088\/1674-1056\/ac11cf"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] W. Guan and L. Liang, \u201cCheck-belief propagation decoding of LDPC codes,\u201d IEEE Trans. Commun., vol.71, no.12, pp.6849-6858, Dec. 2023, doi: 10.1109\/TCOMM.2023.3308155. 10.1109\/tcomm.2023.3308155","DOI":"10.1109\/TCOMM.2023.3308155"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] A.I.V. Casado, M. Griot, and R.D. Wesel, \u201cLDPC decoders with informed dynamic scheduling,\u201d IEEE Trans. Commun., vol.58, no.12, pp.3470-3479, Dec. 2010 10.1109\/tcomm.2010.101910.070303","DOI":"10.1109\/TCOMM.2010.101910.070303"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] H.-C. Lee, Y.-L. Ueng, S.-M. Yeh, and W.-Y. Weng, \u201cTwo informed dynamic scheduling strategies for iterative LDPC decoders,\u201d IEEE Trans. Commun., vol.61, no.3, pp.886-896, March 2013. 10.1109\/tcomm.2013.012313.120172","DOI":"10.1109\/TCOMM.2013.012313.120172"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] H. Zhang and S. Chen, \u201cResidual-decaying-based informed dynamic scheduling for belief-propagation decoding of LDPC codes,\u201d IEEE Access, vol.7, pp.23656-23666, 2019. 10.1109\/access.2019.2899106","DOI":"10.1109\/ACCESS.2019.2899106"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] T.C.-Y. Chang, P.-H. Wang, J.-J. Weng, I.-H. Lee, and Y.T. Su, \u201cBelief-propagation decoding of LDPC codes with variable node-centric dynamic schedules,\u201d IEEE Trans. Commun., vol.69, no.8, pp.5014-5027, Aug. 2021, doi: 10.1109\/TCOMM.2021.3078776. 10.1109\/tcomm.2021.3078776","DOI":"10.1109\/TCOMM.2021.3078776"},{"key":"15","unstructured":"[15] Q. Zhu and L.-N. WU, \u201cLow-complexity check-node-based serial scheduling belief propagation for LDPC codes,\u201d Journal of Signal Processing, vol.29, no.5, pp.550-556, 2013."},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] R. Yuan, T. Xie, and Z. Wang, \u201cA reliability profile based low-complexity dynamic schedule LDPC decoding,\u201d IEEE Access, vol.10, pp.3390-3399, 2022. 10.1109\/access.2021.3138760","DOI":"10.1109\/ACCESS.2021.3138760"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] H.-Y. Kwak, J.-S. No, and H. Park, \u201cDesign of irregular SC-LDPC codes with non-uniform degree distributions by linear programming,\u201d IEEE Trans. Commun., vol.67, no.4, pp.2632-2646, April 2019, doi: 10.1109\/TCOMM.2018.2889850. 10.1109\/tcomm.2018.2889850","DOI":"10.1109\/TCOMM.2018.2889850"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/6\/E108.A_2024EAL2080\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T03:42:53Z","timestamp":1749267773000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/6\/E108.A_2024EAL2080\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,1]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2024eal2080","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,1]]},"article-number":"2024EAL2080"}}