{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T00:05:46Z","timestamp":1722729946076},"reference-count":18,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2024,8,1]]},"DOI":"10.1587\/transfun.2023eal2045","type":"journal-article","created":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T22:12:58Z","timestamp":1700518378000},"page":"1395-1399","source":"Crossref","is-referenced-by-count":0,"title":["An Investigation on LP Decoding of Short Binary Linear Codes With the Subgradient Method"],"prefix":"10.1587","volume":"E107.A","author":[{"given":"Haiyang","family":"LIU","sequence":"first","affiliation":[{"name":"Institute of Microelectronics, Chinese Academy of Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaopeng","family":"JIAO","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lianrong","family":"MA","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Tsinghua University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] J. Feldman, \u201cDecoding error-correcting codes via linear programming,\u201d Ph.D. Dissertation, MIT, Cambridge, MA, 2003."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] X. Zhang and P.H. Siegel, \u201cEfficient iterative LP decoding of LDPC codes with alternating direction method of multipliers,\u201d Proc. IEEE Int. Symp. Inf. Theory, Istanbul, Turkey, pp.1501-1505, July 2013. 10.1109\/isit.2013.6620477","DOI":"10.1109\/ISIT.2013.6620477"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] 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, Nov. 2013. 10.1109\/lcomm.2013.101413.130826","DOI":"10.1109\/LCOMM.2013.101413.130826"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] 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, Dec. 2013. 10.1109\/tit.2013.2281372","DOI":"10.1109\/TIT.2013.2281372"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] 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, June 2016. 10.1109\/TIT.2016.2555847","DOI":"10.1109\/TIT.2016.2555847"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] 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, April 2017. 10.1109\/tcomm.2017.2659733","DOI":"10.1109\/TCOMM.2017.2659733"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] J. Bai, Y. Wang, and F. Lau, \u201cMinimum-polytope-based linear programming decoder for LDPC codes via ADMM approach,\u201d IEEE Wireless Commun. Lett., vol.8, no.4, pp.1032-1035, Aug. 2019. 10.1109\/lwc.2019.2904565","DOI":"10.1109\/LWC.2019.2904565"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] 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, Sept. 2019. 10.1109\/lcomm.2019.2926085","DOI":"10.1109\/LCOMM.2019.2926085"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Y. Wei, M.-M. Zhao, M.-J. Zhao, and M. Lei, \u201cADMM-based decoder for binary linear codes aided by deep learning,\u201d IEEE Commun. Lett., vol.24, no.5, pp.1028-1032, May 2020. 10.1109\/lcomm.2020.2974199","DOI":"10.1109\/LCOMM.2020.2974199"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] F. Gensheimer, T. Dietz, K. Kraft, S. Ruzika, and N. Wehn, \u201cA reduced-complexity projection algorithm for ADMM-based LP decoding,\u201d IEEE Trans. Inf. Theory, vol.66, no.8, pp.4819-4833, Aug. 2020. 10.1109\/tit.2020.2984247","DOI":"10.1109\/TIT.2020.2984247"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] A. Asadzadeh, M. Barakatain, S.C. Draper, and J. Mitra, \u201cSAPA: Sparse affine projection algorithm in ADMM-LP decoding of LDPC codes,\u201d Proc. Canadian Workshop on Information Theory, pp.1-6, 2022. 10.1109\/cwit55308.2022.9817674","DOI":"10.1109\/CWIT55308.2022.9817674"},{"key":"12","unstructured":"[12] D. Bertsimas and J.N. Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, Belmont, MA, 1997."},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] K. Yang, X. Wang, and J. Feldman, \u201cA new linear programming approach to decoding linear block codes,\u201d IEEE Trans. Inf. Theory, vol.54, no.3, pp.1061-1072, March 2008. 10.1109\/tit.2007.915712","DOI":"10.1109\/TIT.2007.915712"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] M.C. Coskun, G. Durisi, T. Jerkovits, G. Liva, W. Ryan, B. Stein, and F. Steiner, \u201cEfficient error-correcting codes in the short blocklength regime,\u201d Physical Commnunication, vol.34, pp.66-79, June 2019. 10.1016\/j.phycom.2019.03.004","DOI":"10.1016\/j.phycom.2019.03.004"},{"key":"15","unstructured":"[15] S. Lin and D.J. Costello Jr., Error Correcting Coding: Fundamentals and Applications, 2nd ed., Prentice-Hall, Upper Saddle River, NJ, 2004."},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] X.-Y. Hu, E. Eleftheriou, and D.M. Arnold, \u201cRegular and irregular progressive edge-growth Tanner graphs,\u201d IEEE Trans. Inf. Theory, vol.51, no.1, pp.386-398, Jan. 2005. 10.1109\/tit.2004.839541","DOI":"10.1109\/TIT.2004.839541"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] R. Smarandache and P.O. Vontobel, \u201cPseudo-codeword analysis of Tanner graphs from projective and Euclidean planes,\u201d IEEE Trans. Inf. Theory, vol.53, no.7, pp.2376-2393, July 2007. 10.1109\/tit.2007.899563","DOI":"10.1109\/TIT.2007.899563"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] S.-T. Xia and F.-W. Fu, \u201cMinimum pseudoweight and minimum pseudocodewords of LDPC codes,\u201d IEEE Trans. Inf. Theory, vol.54, no.1, pp.480-485, Jan. 2008. 10.1109\/tit.2007.911177","DOI":"10.1109\/TIT.2007.911177"}],"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\/E107.A\/8\/E107.A_2023EAL2045\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T03:24:08Z","timestamp":1722655448000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E107.A\/8\/E107.A_2023EAL2045\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,1]]},"references-count":18,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2023eal2045","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2024,8,1]]},"article-number":"2023EAL2045"}}