{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:10:31Z","timestamp":1751688631073},"reference-count":16,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2021,10,1]]},"DOI":"10.1587\/transfun.2020eal2116","type":"journal-article","created":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T22:08:08Z","timestamp":1617314888000},"page":"1425-1429","source":"Crossref","is-referenced-by-count":5,"title":["An Enhanced HDPC-EVA Decoder Based on ADMM"],"prefix":"10.1587","volume":"E104.A","author":[{"given":"Yujin","family":"ZHENG","sequence":"first","affiliation":[{"name":"College of Physical Science and Technology, Central China Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"LIN","sequence":"additional","affiliation":[{"name":"College of Physical Science and Technology, Central China Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuo","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Shanghai Aerospace Electronic Technology Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinglin","family":"ZHANG","sequence":"additional","affiliation":[{"name":"College of Physical Science and Technology, Central China Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiaoqiao","family":"XIA","sequence":"additional","affiliation":[{"name":"College of Physical Science and Technology, Central China Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] R.J. McEliece, D.J.C. MacKay, and J.F. Cheng, \u201cTurbo decoding as an instance of pearl&apos;s \u201cbelief propagation\u201d algorithm,\u201d IEEE J. Sel. Areas Commun., vol.16, no.2, pp.140-152, 1998. 10.1109\/49.661103","DOI":"10.1109\/49.661103"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] J. Feldman, M.J. Wainwright, and D.R. Karger, \u201cUsing linear programming to decode binary linear codes,\u201d IEEE Trans. Inf. Theory, vol.51, no.3, pp.954-972, 2005. 10.1109\/tit.2004.842696","DOI":"10.1109\/TIT.2004.842696"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] S. Barman, X. Liu, S.C. Draper, and B. Recht, \u201cDecomposition methods for large scale LP decoding,\u201d IEEE Trans. Inf. Theory, vol.59, no.12, pp.7870-7886, 2013. 10.1109\/tit.2013.2281372","DOI":"10.1109\/TIT.2013.2281372"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] X. Liu and S.C. Draper, \u201cThe ADMM penalized decoder for LDPC codes,\u201d IEEE Trans. Inf. Theory, vol.62, no.6, pp.2966-2984, 2016. 10.1109\/TIT.2016.2555847","DOI":"10.1109\/TIT.2016.2555847"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] B. Wang, J. Mu, X. Jiao, and Z. Wang, \u201cImproved penalty functions of admm penalized decoder for ldpc codes,\u201d IEEE Commun. Lett., vol.21, no.2, pp.234-237, 2016. 10.1109\/lcomm.2016.2627575","DOI":"10.1109\/LCOMM.2016.2627575"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] X. Jiao, H. Wei, J. Mu, and C. Chen, \u201cImproved ADMM penalized decoder for irregular low-density parity-check codes,\u201d IEEE Commun. Lett., vol.19, no.6, pp.913-916, 2015. 10.1109\/lcomm.2015.2421445","DOI":"10.1109\/LCOMM.2015.2421445"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] X. Zhang and P.H. Siegel, \u201cEfficient iterative LP decoding of LDPC codes with alternating direction method of multipliers,\u201d 2013 IEEE International Symposium on Information Theory, pp.1501-1505, IEEE, 2013. 10.1109\/isit.2013.6620477","DOI":"10.1109\/ISIT.2013.6620477"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] G. Zhang, R. Heusdens, and W.B. Kleijn, \u201cLarge scale LP decoding with low complexity,\u201d IEEE Commun. Lett., vol.17, no.11, pp.2152-2155, 2013. 10.1109\/lcomm.2013.101413.130826","DOI":"10.1109\/LCOMM.2013.101413.130826"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] H. Wei, X. Jiao, and J. Mu, \u201cReduced-complexity linear programming decoding based on ADMM for LDPC codes,\u201d IEEE Commun. Lett., vol.19, no.6, pp.909-912, 2015. 10.1109\/lcomm.2015.2418261","DOI":"10.1109\/LCOMM.2015.2418261"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] X. Jiao, J. Mu, Y.C. He, and C. Chen, \u201cEfficient ADMM decoding of LDPC codes using lookup tables,\u201d IEEE Trans. Commun., vol.65, no.4, pp.1425-1437, 2017. 10.1109\/tcomm.2017.2659733","DOI":"10.1109\/TCOMM.2017.2659733"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] H. Wei and A.H. Banihashemi, \u201cAn iterative check polytope projection algorithm for ADMM-based LP decoding of LDPC codes,\u201d IEEE Commun. Lett., vol.22, no.1, pp.29-32, 2017. 10.1109\/lcomm.2017.2766223","DOI":"10.1109\/LCOMM.2017.2766223"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Y. Lin, Q. Xia, W. He, and Q. Zhang, \u201cA fast iterative check polytope projection algorithm for ADMM decoding of LDPC codes by bisection method,\u201d IEICE Trans. Fundamentals, vol.E102-A, no.10, pp.1406-1410, Oct. 2019. 10.1587\/transfun.e102.a.1406","DOI":"10.1587\/transfun.E102.A.1406"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Q. Xia, Y. Lin, S. Tang, and Q. Zhang, \u201cA fast approximate check polytope projection algorithm for ADMM decoding of LDPC codes,\u201d IEEE Commun. Lett., vol.23, no.9, pp.1520-1523, 2019. 10.1109\/lcomm.2019.2926085","DOI":"10.1109\/LCOMM.2019.2926085"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] A. Tanatmis, S. Ruzika, H.W. Hamacher, M. Punekar, F. Kienle, and N. Wehn, \u201cA separation algorithm for improved LP-decoding of linear block codes,\u201d IEEE Trans. Inf. Theory, vol.56, no.7, pp.3277-3289, 2010. 10.1109\/tit.2010.2048489","DOI":"10.1109\/TIT.2010.2048489"},{"key":"15","unstructured":"[15] A. Yufit, \u201cOn efficient linear programming decoding of hdpc codes,\u201d Master&apos;s thesis, Tel Aviv University, 2014."},{"key":"16","unstructured":"[16] F.J. MacWilliams and N.J.A. Sloane, The Theory of Error Correcting Codes, Elsevier, 1977."}],"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\/E104.A\/10\/E104.A_2020EAL2116\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,2]],"date-time":"2021-10-02T04:17:42Z","timestamp":1633148262000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/10\/E104.A_2020EAL2116\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,1]]},"references-count":16,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020eal2116","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,1]]},"article-number":"2020EAL2116"}}