{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:03:30Z","timestamp":1761663810117},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2019,3,1]]},"DOI":"10.1587\/transcom.2018ebp3177","type":"journal-article","created":{"date-parts":[[2018,9,5]],"date-time":"2018-09-05T22:24:10Z","timestamp":1536186250000},"page":"496-509","source":"Crossref","is-referenced-by-count":3,"title":["An Iterative Decoding Scheme for CPM-QC-LDPC Codes Based on Matrix Transform"],"prefix":"10.23919","volume":"E102.B","author":[{"given":"Zuohong","family":"XU","sequence":"first","affiliation":[{"name":"College of Electronic Science and Engineering, National University of Defense and Technology"}]},{"given":"Jiang","family":"ZHU","sequence":"additional","affiliation":[{"name":"College of Electronic Science and Engineering, National University of Defense and Technology"}]},{"given":"Qian","family":"CHENG","sequence":"additional","affiliation":[{"name":"College of Electronic Science and Engineering, National University of Defense and Technology"}]},{"given":"Zixuan","family":"ZHANG","sequence":"additional","affiliation":[{"name":"College of Computer, National University of Defense and Technology"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] R.G. Gallager, \u201cLow density parity-check codes,\u201d IEEE Trans. Inf. Theory, vol.8, no.1, pp.21-28, 1962. 10.1109\/tit.1962.1057683","DOI":"10.1109\/TIT.1962.1057683"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] H. Xu, \u201cBilayer lengthened QC-LDPC codes design for relay channel,\u201d IEICE Trans. Commun., vol.E97-B, no.7, pp.1365-1374, July 2014. 10.1587\/transcom.e97.b.1365","DOI":"10.1587\/transcom.E97.B.1365"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Y. Yu, S. Handa, F. Sasamori, and O. Takyu, \u201cAdaptive iterative decoding of finite-length differentially encoded LDPC coded systems with multiple-symbol differential detection,\u201d IEICE Trans. Commun., vol.E96-B, no.3, pp.847-858, March 2013. 10.1587\/transcom.e96.b.847","DOI":"10.1587\/transcom.E96.B.847"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] N. Kamiya, Y. Hashimoto, and M. Shigihara, \u201cDesign and implementation of long high-rate QC-LDPC codes and its applications to optical transmission systems,\u201d IEICE Trans. Commun., vol.E96-B, no.6, pp.1402-1411, June 2013. 10.1587\/transcom.e96.b.1402","DOI":"10.1587\/transcom.E96.B.1402"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] Y. Nakamura, Y. Okamoto, H. Osawa, H. Aoi, and H. Muraoka, \u201cPerformance evaluation of non-binary LDPC coding and iterative decoding system for BPM R\/W channel with write-errors,\u201d IEICE Trans. Commun., vol.E96-C, no.12, pp.1497-1503, Dec. 2013. 10.1587\/transele.e96.c.1497","DOI":"10.1587\/transele.E96.C.1497"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] J. Li, K. Liu, S. Lin, and K. Abdel-Ghaffar, \u201cAlgebraic quasi-cyclic LDPC codes: Construction, low error-floor, large girth and a reduced-complexity decoding scheme,\u201d IEEE Trans. Commun., vol.62, no.8, pp.2626-2637, 2013. 10.1109\/tcomm.2014.2339329","DOI":"10.1109\/TCOMM.2014.2339329"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] 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, 2006. 10.1109\/tcomm.2005.861667","DOI":"10.1109\/TCOMM.2005.861667"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] W.E. Ryan and S. Lin, Channel Codes: Classical and Modern, pp.213-254, Cambridge University Press, New York, 2009. 10.1017\/cbo9780511803253","DOI":"10.1017\/CBO9780511803253"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] J. Kang, Q. Huang, L. Zhang, B. Zhou, and S. Lin, \u201cQuasi-cyclic LDPC codes: An algebraic construction,\u201d IEEE Trans. Commun., vol.58, no.5, pp.1383-1396, 2010. 10.1109\/tcomm.2010.05.090211","DOI":"10.1109\/TCOMM.2010.05.090211"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Z. Li, Q. Huang, S. Lin, K. Abdel-Ghaffar, and I.F. Blake, \u201cQuasi-cyclic LDPC codes: An algebraic construction, rank analysis, codes on Latin squares,\u201d IEEE Trans. Commun., vol.58, no.11, pp.3126-3139, 2010. 10.1109\/tcomm.2010.091710.090721","DOI":"10.1109\/TCOMM.2010.091710.090721"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Z. Li, S. Lin, K. Abdel-Ghaffar, Z. Ding, and B. Zhou, \u201cQuasi-cyclic LDPC codes on cyclic subgroups of finite fields,\u201d IEEE Trans. Commun., vol.59, no.9, pp.2330-2336, 2011. 10.1109\/tcomm.2011.060911.100208","DOI":"10.1109\/TCOMM.2011.060911.100208"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Q. Huang, Q. Diao, S. Lin, and K. Abdel-Ghaffar, \u201cCyclic and quasi-cyclic LDPC codes on constrained parity-check matrices and their trapping sets,\u201d IEEE Trans. Inf. Theory, vol.58, no.5, pp.2648-2671, 2012. 10.1109\/tit.2011.2179842","DOI":"10.1109\/TIT.2011.2179842"},{"key":"13","unstructured":"[13] S. Lin, \u201cCapacity-approaching low-density parity-check codes: recent developments and applications,\u201d The 2013 Workshop on Coding and Information Theory, pp.11-13, Hong Kong, China, Jan. 2013."},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Y.Y. Tai, L. Lan, L. Zeng, S. Lin, and K. Abdel-Ghaffar, \u201cAlgebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channels,\u201d IEEE Trans. Commun., vol.54, no.10, pp.1765-1774, 2006. 10.1109\/tcomm.2006.881361","DOI":"10.1109\/TCOMM.2006.881361"},{"key":"15","unstructured":"[15] K. Liu, Algebraic LDPC codes: construction, analysis and reduced-complexity decoding, Ph.D. Thesis, University of California, California, USA, 2015."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] J. Li, K. Liu, S. Lin, and K. Abdel-Ghaffar, \u201cDecoding of quasi-cyclic LDPC codes with section-wise cyclic structure,\u201d Information Theory and Applications Workshop, pp.1-10, San Diego, CA, USA, Feb. 2014. 10.1109\/ita.2014.6804221","DOI":"10.1109\/ITA.2014.6804221"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] J. Li, K. Liu, S. Lin, and K. Abdel-Ghaffar, \u201cQuasi-cyclic LDPC codes on two arbitrary sets of a finite field,\u201d IEEE International Symposium on Information Theory, pp.2454-2458, Honolulu, HI, USA, June-July 2014. 10.1109\/isit.2014.6875275","DOI":"10.1109\/ISIT.2014.6875275"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] E. Ankan, N.U. Hassan, M. Lentmaier, G. Montorsi, and J. Sayir, \u201cChallenges and some new directions in channel coding,\u201d J. Commun. Netw., vol.17, no.4, pp.328-338, 2015. 10.1109\/jcn.2015.000063","DOI":"10.1109\/JCN.2015.000063"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] C. Di, D. Proietti, I.E. Telatar, T.J. Richardson, and R.L. Urbanke, \u201cFinite length analysis of low-density parity-check codes on the binary erasure channel,\u201d IEEE Trans. Inf. Theory, vol.48, no.6, pp.1570-1579, 2002. 10.1109\/tit.2002.1003839","DOI":"10.1109\/TIT.2002.1003839"},{"key":"20","unstructured":"[20] T. Richardson, \u201cError-floors of LDPC codes,\u201d Proc. 41st Annual Allerton Conference on Communication, Control and Computing, pp.1426-1435, Sept. 2003."},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] H. Yang and W.E. Ryan, \u201cLow-floor decoders for LDPC codes,\u201d IEEE Trans. Commun., vol.57, no.6, pp.1663-1673, 2009. 10.1109\/tcomm.2009.06.070325","DOI":"10.1109\/TCOMM.2009.06.070325"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] S. Laendner, T. Hehn, O. Milenkovic, and J.B. Huber, \u201cWhen does one redundant parity-check equation matter?,\u201d IEEE Global Telecommunications Conference, pp.1-6, Nov. 2006. 10.1109\/glocom.2006.44","DOI":"10.1109\/GLOCOM.2006.44"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] O. Fainzelber, E. Sharon, and S. Litsyn, \u201cDecreasing error floor in LDPC codes by parity-check matrix extensions,\u201d IEEE International Symposium on Information Theory, pp.374-378, June 2009. 10.1109\/isit.2009.5205738","DOI":"10.1109\/ISIT.2009.5205738"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] S. Kang, J. Moon, J. Ha, and J. Shin, \u201cBreaking the trapping sets in LDPC codes: Check node removal and collaborative decoding,\u201d IEEE Trans. Commun., vol.64, no.1, pp.15-26, Jan. 2016. 10.1109\/tcomm.2015.2498161","DOI":"10.1109\/TCOMM.2015.2498161"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] D. Yuan, L. Li, and Y. Liu, \u201cLowering the error floors of low-density parity-check codes with additional check nodes,\u201d 2017 IEEE Information Theory Workshop, Nov. 2017. 10.1109\/itw.2017.8277936","DOI":"10.1109\/ITW.2017.8277936"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] F. Kschischang, B. Frey, and H.A. Loeliger, \u201cFactor graphs and the sum-product algorithm,\u201d IEEE Trans. Inf. Theory, vol.47, no.2, pp.498-519, 2001. 10.1109\/18.910572","DOI":"10.1109\/18.910572"},{"key":"27","unstructured":"[27] D.J.C. Mackay, \u201cEncyclopedia of sparse graph codes,\u201d Information Theory & Applications Workshop, Madison, WI, USA, Aug. 1999."}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E102.B\/3\/E102.B_2018EBP3177\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T15:02:35Z","timestamp":1704898955000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E102.B\/3\/E102.B_2018EBP3177\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,1]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2018ebp3177","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,1]]}}}