{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T22:13:39Z","timestamp":1773094419985,"version":"3.50.1"},"reference-count":85,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2022,8,1]]},"DOI":"10.1587\/transcom.2021ebi0001","type":"journal-article","created":{"date-parts":[[2022,2,9]],"date-time":"2022-02-09T22:09:31Z","timestamp":1644444571000},"page":"894-905","source":"Crossref","is-referenced-by-count":5,"title":["LDPC Codes for Communication Systems: Coding Theoretic Perspective"],"prefix":"10.23919","volume":"E105.B","author":[{"given":"Takayuki","family":"NOZAKI","sequence":"first","affiliation":[{"name":"The Research Institute for Time Studies, Yamaguchi University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Motohiko","family":"ISAKA","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, Kwansei Gakuin University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] R. Gallager, \u201cLow-density parity-check codes,\u201d IRE Trans. Inf. Theory, vol.8, no.1, pp.21-28, Jan. 1962. 10.1109\/tit.1962.1057683","DOI":"10.1109\/TIT.1962.1057683"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[3] T.J. Richardson and R.L. Urbanke, \u201cThe capacity of low-density parity-check codes under message-passing decoding,\u201d IEEE Trans. Inf. Theory, vol.47, no.2, pp.599-618, 2001. 10.1109\/18.910577","DOI":"10.1109\/18.910577"},{"key":"3","unstructured":"[4] \u201cIEEE standard for ethernet,\u201d IEEE Std 802.3-2015 (Revision of IEEE Std 802.3-2012), pp.1-4017, March 2016."},{"key":"4","unstructured":"[5] \u201cIEEE standard for information technology-telecommunications and information exchange between systems local and metropolitan area networks-specific requirements-part 11: Wireless LAN medium access control (MAC) and physical layer (PHY) specifications,\u201d IEEE Std 802.11-2016 (Revision of IEEE Std 802.11-2012), pp.1-3534, Dec. 2016."},{"key":"5","unstructured":"[6] \u201cIEEE standard for air interface for broadband wireless access systems,\u201d IEEE Std 802.16-2012 (Revision of IEEE Std 802.16-2009), pp.1-2542, Aug. 2012."},{"key":"6","unstructured":"[7] \u201cFrame structure channel coding and modulation for a second generation digital transmission system for cable systems (DVB-C2),\u201d DVB Standards, Oct. 2015."},{"key":"7","unstructured":"[8] \u201cSecond generation framing structure, channel coding and modulation systems for broadcasting, interactive services, news gathering and other broadband satellite applications; part 1 (DVB-S2),\u201d DVB Standards, Nov. 2014."},{"key":"8","unstructured":"[9] \u201cFrame structure channel coding and modulation for a second generation digital terrestrial television broadcasting system (DVB-T2),\u201d DVB Standards, July 2015."},{"key":"9","unstructured":"[10] A.T.S. Committee, \u201cAtsc standard: Physical layer protocol,\u201d Doc. A\/322, 2017."},{"key":"10","unstructured":"[11] Association of Radio Industries and Businesses, \u201cTransmission system for advanced wide band digital satellite broadcasting (isdb-s3),\u201d ARIB STD-B44 version 2.1, 2016."},{"key":"11","unstructured":"[12] \u201cCCSDS 211.0-b-5; recommendation for space data system standards,\u201d CCSDS, Dec. 2013."},{"key":"12","unstructured":"[13] \u201c5G; NR; multiplexing and channel coding,\u201d 3GPP TS 38.212 version 15.2.0 Release 15, 2018."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[14] C. Shannon, \u201cA mathematical theory of communication,\u201d Bell Syst. Tech. J., vol.27, no.10, pp.379-423, 623-656, Oct. 1948. 10.1002\/j.1538-7305.1948.tb00917.x","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"14","unstructured":"[15] E.R. Berlekamp, Algebraic Coding Theory, Argen Park Press, 1968."},{"key":"15","unstructured":"[16] G. Liva, L. Gaudio, T. Ninacs, and T. Jerkovits, \u201cCode design for short blocks: A survey,\u201d European Conf. on Networks and Communications (EuCNC), 2016."},{"key":"16","doi-asserted-by":"publisher","unstructured":"[17] E. Nachmani, E. Marciano, L. Lugosch, W.J. Gross, D. Burstein, and Y. Be&apos;ery, \u201cDeep learning methods for improved decoding of linear codes,\u201d IEEE Sel. Top. Signal Process., vol.12, no.1, pp.119-131, Feb. 2018. 10.1109\/jstsp.2017.2788405","DOI":"10.1109\/JSTSP.2017.2788405"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[18] D.J.C. MacKay and R.M. Neal, \u201cNear Shannon limit performance of low density parity check codes,\u201d Electron. Lett., vol.32, no.18, pp.1645-1646, 1996. 10.1049\/el:19961141","DOI":"10.1049\/el:19961141"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[19] C. Berrou, A. Glavieux, and P. Thitimajshima, \u201cNear Shannon limit error-correcting coding: Turbo codes,\u201d Proc. Int. Conf. Commun. (ICC1993), pp.1064-1070, May 1993. 10.1109\/icc.1993.397441","DOI":"10.1109\/ICC.1993.397441"},{"key":"19","unstructured":"[20] \u201cLTE; multiplexing and channel coding,\u201d 3GPP TS 36.212 version 12.4.0 Release 12, 2015."},{"key":"20","unstructured":"[21] D.J.C. MacKay, Information Theory, Inference, and Learning Algorithms, Cambridge Univ. Press, 2003."},{"key":"21","doi-asserted-by":"publisher","unstructured":"[22] M.P.C. Fossorier and S. Lin, \u201cSoft-decision decoding of linear block codes based on ordered statistics,\u201d IEEE Trans. Inf. Theory, vol.41, no.5, pp.1379-1396, Sept. 1995. 10.1109\/18.412683","DOI":"10.1109\/18.412683"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[23] F.R. Kschischang, B.J. Frey, and H.-A. Loeliger, \u201cFactor graphs and the sum-product algorithm,\u201d IEEE Trans. Inf. Theory, vol.47, no.2, pp.498-519, Feb. 2001. 10.1109\/18.910572","DOI":"10.1109\/18.910572"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[24] J. Hagenauer, E. Offer, and L. Papke, \u201cIterative decoding of binary block and convolutional codes,\u201d IEEE Trans. Inf. Theory, vol.42, no.2, pp.429-445, March 1996. 10.1109\/18.485714","DOI":"10.1109\/18.485714"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[25] E. Arikan, \u201cChannel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,\u201d IEEE Trans. Inf. Theory, vol.55, no.7, pp.3051-3073, June 2009. 10.1109\/tit.2009.2021379","DOI":"10.1109\/TIT.2009.2021379"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[26] E. \u015ea\u015fo\u011flu, Polarization and Polar Codes, Found. Trends Commun. Inform. Theory, Now Publishers, 2012.","DOI":"10.1561\/9781601985972"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[27] I. Tal and A. Vardy, \u201cList decoding of polar codes,\u201d IEEE Trans. Inf. Theory, vol.61, no.5, pp.2213-2226, May 2015. 10.1109\/tit.2015.2410251","DOI":"10.1109\/TIT.2015.2410251"},{"key":"27","unstructured":"[28] E. Arikan, \u201cPolar code: A pipelined implementations,\u201d Proc. 4th ISBM, pp.11-14, July 2010."},{"key":"28","doi-asserted-by":"publisher","unstructured":"[29] S. Kudekar, M. Mondelli, H.D. Pfister, E. \u015ea\u015fo\u011flu, and R. Urbanke, \u201cReed-Muller codes achieve capatity on erasure channels,\u201d IEEE Trans. Inf. Theory, vol.63, no.7, pp.4298-4316, July 2017. 10.1109\/tit.2017.2673829","DOI":"10.1109\/TIT.2017.2673829"},{"key":"29","doi-asserted-by":"publisher","unstructured":"[30] M. Geiselhart, A. Elkelesh, M. Ebada, S. Cammerer, and S. t. Brink, \u201cAutomorphism ensemble decoding of Reed-Muller codes,\u201d IEEE Trans. Commun., vol.69, no.10, pp.6424-6438, 2021. 10.1109\/tcomm.2021.3098798","DOI":"10.1109\/TCOMM.2021.3098798"},{"key":"30","doi-asserted-by":"publisher","unstructured":"[32] Y. Kou, S. Lin, and M.P.C. Fossorier, \u201cLow-density parity-check codes based on finite geometries: A rediscovery and new results,\u201d IEEE Trans. Inf. Theory, vol.47, no.7, pp.2711-2736, Nov 2001. 10.1109\/18.959255","DOI":"10.1109\/18.959255"},{"key":"31","doi-asserted-by":"publisher","unstructured":"[33] X. Wu, C. Ling, M. Jiang, E. Xu, C. Zhao, and X. You, \u201cNew insights into weighted bit-flipping decoding,\u201d IEEE Trans. Commun., vol.57, no.8, pp.2177-2180, Aug. 2009. 10.1109\/tcomm.2009.08.070257","DOI":"10.1109\/TCOMM.2009.08.070257"},{"key":"32","doi-asserted-by":"publisher","unstructured":"[34] T. Wadayama, K. Nakamura, M. Yagita, Y. Funahashi, S. Usami, and I. Takumi, \u201cGradient descent bit flipping algorithms for decoding LDPC codes,\u201d IEEE Trans. Commun., vol.58, no.6, pp.1610-1614, June 2010. 10.1109\/tcomm.2010.06.090046","DOI":"10.1109\/TCOMM.2010.06.090046"},{"key":"33","doi-asserted-by":"crossref","unstructured":"[35] V. Savin, \u201cGradient descent bit-flip decoding with momentum,\u201d 2021-11th International Symposium on Topics in Coding (ISTC), IEEE, 2021. 10.1109\/istc49272.2021.9594128","DOI":"10.1109\/ISTC49272.2021.9594128"},{"key":"34","unstructured":"[36] D. Hocevar, \u201cA reduced complexity decoder architecture via layered decoding of LDPC codes,\u201d IEEE Workshop on Signal Processing Systems (SIPS), 2004, pp.107-112, Oct. 2004. 10.1109\/sips.2004.1363033"},{"key":"35","doi-asserted-by":"publisher","unstructured":"[37] J. Zhang and M.P.C. Fossorier, \u201cShuffled iterative decoding,\u201d IEEE Trans. Commun., vol.53, no.2, pp.209-213, Feb. 2005. 10.1109\/tcomm.2004.841982","DOI":"10.1109\/TCOMM.2004.841982"},{"key":"36","doi-asserted-by":"publisher","unstructured":"[38] H.C. Lee and Y.L. Ueng, \u201cLDPC decoding scheduling for faster convergence and lower error floor,\u201d IEEE Trans. Commun., vol.62, no.9, pp.3104-3113, Sept. 2014. 10.1109\/tcomm.2014.2349943","DOI":"10.1109\/TCOMM.2014.2349943"},{"key":"37","doi-asserted-by":"publisher","unstructured":"[39] C.A. Aslam, Y.L. Guan, K. Cai, and G. Han, \u201cInformed fixed scheduling for faster convergence of shuffled belief-propagation decoding,\u201d IEEE Commun. Lett., vol.21, no.1, pp.32-35, Jan. 2017. 10.1109\/lcomm.2016.2617309","DOI":"10.1109\/LCOMM.2016.2617309"},{"key":"38","doi-asserted-by":"publisher","unstructured":"[40] M.P.C. Fossorier, M. Mihaljevic, and H. Imai, \u201cReduced complexity iterative decoding of low-density parity check codes based on belief propagation,\u201d IEEE Trans. Commun., vol.47, no.5, pp.673-680, May 1999. 10.1109\/26.768759","DOI":"10.1109\/26.768759"},{"key":"39","doi-asserted-by":"publisher","unstructured":"[41] J. Chen, A. Dholakia, E. Eleftheriou, M.P.C. Fossorier, and X.-Y. Hu, \u201cReduced-complexity decoding of LDPC codes,\u201d IEEE Trans. Commun., vol.53, no.8, pp.1288-1299, Aug. 2005. 10.1109\/tcomm.2005.852852","DOI":"10.1109\/TCOMM.2005.852852"},{"key":"40","unstructured":"[43] J.K.S. Lee and J. Thorpe, \u201cMemory-efficient decoding of LDPC codes,\u201d Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp.459-463, Sept. 2005. 10.1109\/isit.2005.1523376"},{"key":"41","doi-asserted-by":"publisher","unstructured":"[44] S.K. Planjery, D. Declercq, L. Danjean, and B. Vasic, \u201cFinite alphabet iterative decoders part I: Decoding beyond belief propagation on the binary symmetric channel,\u201d IEEE Trans. Commun., vol.61, no.10, pp.4033-4045, Oct. 2013. 10.1109\/tcomm.2013.090513.120443","DOI":"10.1109\/TCOMM.2013.090513.120443"},{"key":"42","doi-asserted-by":"publisher","unstructured":"[45] S. Ten Brink, \u201cConvergence of iterative decoding,\u201d Electron. Lett., vol.35, no.10, pp.806-808, 1999. 10.1049\/el:19990555","DOI":"10.1049\/el:19990555"},{"key":"43","unstructured":"[46] A. Amraoui, \u201cAsymptotic and finite-length optimization of LDPC codes,\u201d Ph.D. dissertation, EPFL, 2006."},{"key":"44","doi-asserted-by":"publisher","unstructured":"[47] A. Amraoui, A. Montanari, T. Richardson, and R. Urbanke, \u201cFinite-length scaling for iteratively decoded LDPC ensembles,\u201d IEEE Trans. Inf. Theory, vol.55, no.2, pp.473-498, 2009. 10.1109\/tit.2008.2009580","DOI":"10.1109\/TIT.2008.2009580"},{"key":"45","doi-asserted-by":"crossref","unstructured":"[48] J. Ezri, A. Montanari, S. Oh, and R. Urbanke, \u201cThe slope scaling parameter for general channels, decoders, and ensembles,\u201d 2008 IEEE International Symposium on Information Theory, pp.1443-1447, July 2008. 10.1109\/isit.2008.4595226","DOI":"10.1109\/ISIT.2008.4595226"},{"key":"46","doi-asserted-by":"publisher","unstructured":"[49] P.M. Olmos and R.L. Urbanke, \u201cA scaling law to predict the finite-length performance of spatially-coupled LDPC codes,\u201d IEEE Trans. Inf. Theory, vol.61, no.6, pp.3164-3184, June 2015. 10.1109\/tit.2015.2422816","DOI":"10.1109\/TIT.2015.2422816"},{"key":"47","doi-asserted-by":"publisher","unstructured":"[50] T. Tian, C.R. Jones, J.D. Villasenor, and R.D. Wesel, \u201cSelective avoidance of cycles in irregular LDPC code construction,\u201d IEEE Trans. Commun., vol.52, no.8, pp.1242-1247, Aug. 2004. 10.1109\/tcomm.2004.833048","DOI":"10.1109\/TCOMM.2004.833048"},{"key":"48","doi-asserted-by":"publisher","unstructured":"[51] T.J. Richardson and R.L. Urbanke, \u201cEfficient encoding of low-density parity-check codes,\u201d IEEE Trans. Inf. Theory, vol.47, no.2, pp.638-656, Feb. 2001. 10.1109\/18.910579","DOI":"10.1109\/18.910579"},{"key":"49","doi-asserted-by":"crossref","unstructured":"[52] S.K. Chilappagari, S. Sankaranarayanan, and B. Vasic, \u201cError floors of LDPC codes on the binary symmetric channel,\u201d Proc. IEEE Int. Conf. Commun. (ICC2006), vol.3, pp.1089-1094, June 2006. 10.1109\/icc.2006.254892","DOI":"10.1109\/ICC.2006.254892"},{"key":"50","doi-asserted-by":"publisher","unstructured":"[53] 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":"51","doi-asserted-by":"publisher","unstructured":"[54] H. Xiao and A.H. Banihashemi, \u201cImproved progressive-edge-growth (PEG) construction of irregular LDPC codes,\u201d IEEE Commun. Lett., vol.8, no.12, pp.715-717, Dec. 2004. 10.1109\/lcomm.2004.839612","DOI":"10.1109\/LCOMM.2004.839612"},{"key":"52","doi-asserted-by":"crossref","unstructured":"[55] G. Richter and A. Hof, \u201cOn a construction method of irregular LDPC codes without small stopping sets,\u201d Proc. IEEE Int. Conf. Commun. (ICC2006), vol.3, pp.1119-1124, June 2006. 10.1109\/icc.2006.254897","DOI":"10.1109\/ICC.2006.254897"},{"key":"53","doi-asserted-by":"crossref","unstructured":"[56] M. Diouf, D. Declercq, S. Ouya, and B. Vasic, \u201cA PEG-like LDPC code design avoiding short trapping sets,\u201d Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp.1079-1083, June 2015. 10.1109\/isit.2015.7282621","DOI":"10.1109\/ISIT.2015.7282621"},{"key":"54","doi-asserted-by":"publisher","unstructured":"[57] X. He, L. Zhou, and J. Du, \u201cA new multi-edge metric-constrained PEG algorithm for designing binary LDPC code with improved cycle-structure,\u201d IEEE Trans. Commun., vol.66, no.1, pp.14-25, Jan. 2018. 10.1109\/tcomm.2017.2753805","DOI":"10.1109\/TCOMM.2017.2753805"},{"key":"55","doi-asserted-by":"publisher","unstructured":"[58] Y. Kaji, \u201cEncoding LDPC codes using the triangular factorization,\u201d IEICE Trans. Fundamentals, vol.E89-A, no.10, pp.2510-2518, Oct. 2006. 10.1093\/ietfec\/e89-a.10.2510","DOI":"10.1093\/ietfec\/e89-a.10.2510"},{"key":"56","doi-asserted-by":"crossref","unstructured":"[59] T. Shibuya, \u201cBlock-triangularization of parity check matrices for efficient encoding of linear codes,\u201d Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp.533-537, IEEE, 2011. 10.1109\/isit.2011.6034185","DOI":"10.1109\/ISIT.2011.6034185"},{"key":"57","doi-asserted-by":"crossref","unstructured":"[60] T. Nozaki, \u201cParallel encoding algorithm for LDPC codes based on block-diagonalization,\u201d Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp.1911-1915, IEEE, 2015. 10.1109\/isit.2015.7282788","DOI":"10.1109\/ISIT.2015.7282788"},{"key":"58","unstructured":"[61] Y. Iketo and T. Nozaki, \u201cEncoding algorithm of binary and non-binary irregular LDPC codes via block triangular matrices with low weight diagonal submatrices,\u201d 2020 International Symposium on Information Theory and Its Applications (ISITA), pp.225-229, IEEE, 2020."},{"key":"59","unstructured":"[62] Y. Iketo and T. Nozaki, \u201cEfficient encoding algorithm of binary and non-binary LDPC codes using block triangulation,\u201d arXiv preprint arXiv:2103.01560, 2021. 10.48550\/arXiv.2103.01560"},{"key":"60","unstructured":"[63] D. Divsalar, H. Jin, and R.J. McEliece, \u201cCoding theorems for \u201cTurbo-like\u201d codes,\u201d Proc. Annu. Allerton Conf. Commun., Control, Comput., pp.201-210, vol.36, 1998."},{"key":"61","unstructured":"[64] H. Jin, A. Khandekar, and R. McEliece, \u201cIrregular repeat-accumulate codes,\u201d Proc. 2nd Int. Symp. Turbo codes and related topics, Citeseer, pp.1-8, 2000."},{"key":"62","doi-asserted-by":"publisher","unstructured":"[65] A. Abbasfar, D. Divsalar, and K. Yao, \u201cAccumulate-repeat-accumulate codes,\u201d IEEE Trans. Commun., vol.55, no.4, pp.692-702, April 2007. 10.1109\/tcomm.2007.894109","DOI":"10.1109\/TCOMM.2007.894109"},{"key":"63","unstructured":"[66] J. Thorpe, \u201cLow-density parity-check (LDPC) codes constructed from protographs,\u201d IPN progress report, vol.42, no.154, pp.42-154, 2003."},{"key":"64","doi-asserted-by":"publisher","unstructured":"[67] Z. Li, L. Chen, L. Zeng, S. Lin, and W.H. Fong, \u201cEfficient encoding of quasi-cyclic low-density parity-check codes,\u201d IEEE Trans. Commun., vol.54, no.1, pp.71-81, Jan. 2006. 10.1109\/tcomm.2005.861667","DOI":"10.1109\/TCOMM.2005.861667"},{"key":"65","unstructured":"[68] T. Richardson and R. Urbanke, \u201cMulti-edge type LDPC codes,\u201d Workshop honoring Prof. Bob McEliece on his 60th birthday, California Institute of Technology, Pasadena, California, pp.24-25, 2002."},{"key":"66","doi-asserted-by":"publisher","unstructured":"[69] D. Divsalar, S. Dolinar, C.R. Jones, and K. Andrews, \u201cCapacity-approaching protograph codes,\u201d IEEE J. Sel. Areas Commun., vol.27, no.6, pp.876-888, 2009. 10.1109\/jsac.2009.090806","DOI":"10.1109\/JSAC.2009.090806"},{"key":"67","doi-asserted-by":"crossref","unstructured":"[70] D. Divsalar, C. Jones, S. Dolinar, and J. Thorpe, \u201cProtograph based LDPC codes with minimum distance linearly growing with block size,\u201d Proc. IEEE Global Telecommun. Conf., vol.3, pp.1152-1156, IEEE, 2005. 10.1109\/glocom.2005.1577834","DOI":"10.1109\/GLOCOM.2005.1577834"},{"key":"68","doi-asserted-by":"crossref","unstructured":"[71] H. Uchikawa, \u201cDesign of non-precoded protograph-based LDPC codes,\u201d Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp.2779-2783, IEEE, 2014. 10.1109\/isit.2014.6875340","DOI":"10.1109\/ISIT.2014.6875340"},{"key":"69","doi-asserted-by":"publisher","unstructured":"[72] Y. Fang, G. Bi, Y.L. Guan, and F.C. Lau, \u201cA survey on protograph LDPC codes and their applications,\u201d IEEE Commun. Surveys Tuts., vol.17, no.4, pp.1989-2016, 2015. 10.1109\/comst.2015.2436705","DOI":"10.1109\/COMST.2015.2436705"},{"key":"70","doi-asserted-by":"crossref","unstructured":"[73] M.P.C. Fossorier, \u201cQuasi-cyclic low-density parity-check codes from circulant permutation matrices,\u201d IEEE Trans. Inf. Theory, vol.50, no.8, pp.1788-1793, Aug. 2004. 10.1109\/tit.2004.831841","DOI":"10.1109\/TIT.2004.831841"},{"key":"71","doi-asserted-by":"crossref","unstructured":"[74] P. Panteleev, \u201cFast systematic encoding of quasi-cyclic codes using the chinese remainder theorem,\u201d Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp.1916-1920, June 2015. 10.1109\/isit.2015.7282789","DOI":"10.1109\/ISIT.2015.7282789"},{"key":"72","doi-asserted-by":"crossref","unstructured":"[75] S. Mhaske, H. Kee, T. Ly, A. Aziz, and P. Spasojevic, \u201cHigh-throughput FPGA-based QC-LDPC decoder architecture,\u201d Proc. IEEE Veh. Technol. Conf, pp.1-5, Sept. 2015. 10.1109\/vtcfall.2015.7390967","DOI":"10.1109\/VTCFall.2015.7390967"},{"key":"73","doi-asserted-by":"publisher","unstructured":"[76] S. Kudekar, T.J. Richardson, and R.L. Urbanke, \u201cThreshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC,\u201d IEEE Trans. Inf. Theory, vol.57, no.2, pp.803-834, Feb. 2011. 10.1109\/tit.2010.2095072","DOI":"10.1109\/TIT.2010.2095072"},{"key":"74","doi-asserted-by":"publisher","unstructured":"[77] A.J. Felstrom and K. Zigangirov, \u201cTime-varying periodic convolutional codes with low-density parity-check matrix,\u201d IEEE Trans. Inf. Theory, vol.45, no.6, pp.2181-2191, Sept. 1999. 10.1109\/18.782171","DOI":"10.1109\/18.782171"},{"key":"75","doi-asserted-by":"publisher","unstructured":"[78] A.R. Iyengar, M. Papaleo, P.H. Siegel, J.K. Wolf, A. Vanelli-Coralli, and G.E. Corazza, \u201cWindowed decoding of protograph-based LDPC convolutional codes over erasure channels,\u201d IEEE Trans. Inf. Theory, vol.58, no.4, pp.2303-2320, April 2012. 10.1109\/tit.2011.2177439","DOI":"10.1109\/TIT.2011.2177439"},{"key":"76","doi-asserted-by":"publisher","unstructured":"[79] S. Kudekar, T. Richardson, and R.L. Urbanke, \u201cSpatially coupled ensembles universally achieve capacity under belief propagation,\u201d IEEE Trans. Inf. Theory, vol.59, no.12, pp.7761-7813, Dec. 2013. 10.1109\/tit.2013.2280915","DOI":"10.1109\/TIT.2013.2280915"},{"key":"77","doi-asserted-by":"publisher","unstructured":"[80] M.C. Davey and D. MacKay, \u201cLow-density parity check codes over GF(<i>q<\/i>),\u201d IEEE Commun. Lett., vol.2, no.6, pp.165-167, June 1998. 10.1109\/4234.681360","DOI":"10.1109\/4234.681360"},{"key":"78","doi-asserted-by":"publisher","unstructured":"[81] M.C. Co\u015fkun, G. Durisi, T. Jerkovits, G. Liva, W. Ryan, B. Stein, and F. Steiner, \u201cEfficient error-correcting codes in the short blocklength regime,\u201d Physical Communication, vol.34, pp.66-79, 2019. 10.1016\/j.phycom.2019.03.004","DOI":"10.1016\/j.phycom.2019.03.004"},{"key":"79","doi-asserted-by":"crossref","unstructured":"[82] D. Declercq and M. Fossorier, \u201cDecoding algorithms for nonbinary LDPC codes over GF(<i>q<\/i>),\u201d IEEE Trans. Commun., vol.55, no.4, pp.633-643, April 2007. 10.1109\/tcomm.2007.894088","DOI":"10.1109\/TCOMM.2007.894088"},{"key":"80","doi-asserted-by":"publisher","unstructured":"[83] Q. Huang, M. Zhang, Z. Wang, and L. Wang, \u201cBit-reliability based low-complexity decoding algorithms for non-binary LDPC codes,\u201d IEEE Trans. Commun., vol.62, no.12, pp.4230-4240, 2014. 10.1109\/tcomm.2014.2370032","DOI":"10.1109\/TCOMM.2014.2370032"},{"key":"81","doi-asserted-by":"publisher","unstructured":"[84] F. Garcia-Herrero, D. Declercq, and J. Valls, \u201cNon-binary LDPC decoder based on symbol flipping with multiple votes,\u201d IEEE Commun. Lett., vol.18, no.5, pp.749-752, May 2014. 10.1109\/lcomm.2014.030914.132867","DOI":"10.1109\/LCOMM.2014.030914.132867"},{"key":"82","doi-asserted-by":"crossref","unstructured":"[85] T. Watanabe, T. Ohseki, and K. Yamazaki, \u201cDeep learning-based bit reliability based decoding for non-binary LDPC codes,\u201d Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp.1451-1456, IEEE, 2021. 10.1109\/isit45174.2021.9517790","DOI":"10.1109\/ISIT45174.2021.9517790"},{"key":"83","doi-asserted-by":"publisher","unstructured":"[86] I.B. Djordjevic, \u201cOn advanced FEC and coded modulation for ultra-high-speed optical transmission,\u201d IEEE Commun. Surveys Tuts., vol.18, no.3, pp.1920-1951, thirdquarter 2016. 10.1109\/comst.2016.2536726","DOI":"10.1109\/COMST.2016.2536726"},{"key":"84","doi-asserted-by":"publisher","unstructured":"[87] O. Ferraz, S. Subramaniyan, R. Chinthalaa, J. Andrade, J.R. Cavallaro, S.K. Nandy, V. Silva, X. Zhang, M. Purnaprajna, and G. Falcao, \u201cA survey on high-throughput non-binary LDPC decoders: ASIC, FPGA and GPU architectures,\u201d IEEE Commun. Surveys Tuts., vol.24, no.1, pp.524-556, 2022. 10.1109\/comst.2021.3126127","DOI":"10.1109\/COMST.2021.3126127"},{"key":"85","doi-asserted-by":"publisher","unstructured":"[88] T. Richardson and S. Kudekar, \u201cDesign of low-density parity check codes for 5G new radio,\u201d IEEE Commun. Mag., vol.56, no.3, pp.28-34, March 2018. 10.1109\/mcom.2018.1700839","DOI":"10.1109\/MCOM.2018.1700839"}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E105.B\/8\/E105.B_2021EBI0001\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T06:00:29Z","timestamp":1726639229000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E105.B\/8\/E105.B_2021EBI0001\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,1]]},"references-count":85,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2021ebi0001","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,1]]},"article-number":"2021EBI0001"}}