{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:52:53Z","timestamp":1755035573889,"version":"3.41.0"},"reference-count":23,"publisher":"Engineering and Technology Publishing","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCM"],"published-print":{"date-parts":[[2016]]},"DOI":"10.12720\/jcm.11.10.936-943","type":"journal-article","created":{"date-parts":[[2016,12,26]],"date-time":"2016-12-26T02:43:44Z","timestamp":1482720224000},"source":"Crossref","is-referenced-by-count":5,"title":["High Rate QC-LDPC Codes with Optimization of Maximum Average Girth"],"prefix":"10.12720","author":[{"name":"School of Communication Engineering, Hangzhou Dianzi University, Hangzhou, P. R. China","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianrong","family":"Bao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianghong","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"4977","published-online":{"date-parts":[[2016]]},"reference":[{"key":"ref0","doi-asserted-by":"crossref","unstructured":"[1] I. Djordjevic, W. Ryan, and B. Vasic, Coding for Optical Channels, New York, USA.: Springer-Verlag US, 2010, ch. 3, pp. 75-84.","DOI":"10.1007\/978-1-4419-5569-2_3"},{"key":"ref1","doi-asserted-by":"crossref","unstructured":"[2] R. G. Gallager, Low Density Parity Check Codes, Cambridge, MA, USA.: MIT Press, 1963.","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"[3] D. J. MacKay, \"Good error-correcting codes based on very sparse matrices,\" IEEE Trans. on Information Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.","DOI":"10.1109\/18.748992"},{"key":"ref3","doi-asserted-by":"crossref","unstructured":"[4] R. Tanner, \"A recursive approach to low complexity codes,\" IEEE Trans. on Information Theory, vol. 27, no. 5, pp. 533\u2013547, Sep. 1981.","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref4","doi-asserted-by":"crossref","unstructured":"[5] N. Wiberg, H. A. Loeliger, and R. Kotter, \"Codes and iterative decoding on general graphs,\" European Trans. on Telecommunications, vol. 6, no. 5, pp. 513-525, Sept. 1995.","DOI":"10.1002\/ett.4460060507"},{"key":"ref5","doi-asserted-by":"crossref","unstructured":"[6] W. E. Ryan and S. Lin, Channel Codes: Classic and Modem, 1st ed. New York, USA: Cambridge University Press, 2009, ch. 7, pp. 313-320.","DOI":"10.1017\/CBO9780511803253"},{"key":"ref6","unstructured":"[7] Y. Kou, S. Lin, and M. Fossorier, \"Low-density parity-check codes based on finite geometries: A rediscovery and new results,\" IEEE Trans. on Information Theory, vol. 47, no. 11, pp. 2711\u20132736, Nov. 2001."},{"key":"ref7","doi-asserted-by":"crossref","unstructured":"[8] J. Li, K. Liu, S. Lin, and K. Abde-Ghaffar, \"Algebraic quasi-cyclic LDPC codes: Construction, low error-floor, large girth and a reduced-complexity decoding scheme,\" IEEE Trans. on Communications, vol. 62, no. 8, pp. 2626-2637, Aug. 2014.","DOI":"10.1109\/TCOMM.2014.2339329"},{"key":"ref8","doi-asserted-by":"crossref","unstructured":"[9] L. Zhang, S. Lin, K. Abdel-Ghaffar, et al., \"Quasi-Cyclic LDPC codes on cyclic subgroups of finite fields,\" IEEE Trans. on Communications, vol. 59, no. 9, pp. 2330-2336, Sep. 2011.","DOI":"10.1109\/TCOMM.2011.060911.100208"},{"key":"ref9","unstructured":"[10] B. Zhou, J. Kang, S. Song, S. Lin, et al., \"Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions,\" IEEE Trans. on Communications, vol. 57, no. 6, pp. 1652-1662, June. 2009."},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"[11] Y. Zhang and X. Da, \"Construction of girth-eight QC-LDPC codes from arithmetic progression sequence with large column weight,\" Electronics Letters, vol. 51, no. 16, pp. 1257-1259, April 2015.","DOI":"10.1049\/el.2015.0389"},{"key":"ref11","doi-asserted-by":"crossref","unstructured":"[12] J. Zhang and G. Zhang, \"Deterministic girth-eight QC-LDPC codes with large column weight,\" IEEE Communications Letters, vol. 18, no. 4, pp. 656-659, April 2014.","DOI":"10.1109\/LCOMM.2014.030114.132853"},{"key":"ref12","doi-asserted-by":"crossref","unstructured":"[13] L. Wang, X. Zhang, F. Yu, et al., \"QC-LDPC codes with girth eight based on independent row-column mapping sequence,\" IEEE Communications Letters, vol. 17, no. 11, pp. 2140-2143, Nov. 2013.","DOI":"10.1109\/LCOMM.2013.092813.131581"},{"key":"ref13","doi-asserted-by":"crossref","unstructured":"[14] Y. J. Ko and J. H. Kim, \"Girth conditioning for construction of short block length irregular LDPC codes,\" Electronics Letters, vol. 40, no. 3, pp. 187-188, Feb. 2004.","DOI":"10.1049\/el:20040120"},{"key":"ref14","doi-asserted-by":"crossref","unstructured":"[15] X. Hu, E. Eleftheriou, and D. M. Arnold, \"Regular and irregular progressive edge-growth tanner graphs,\" IEEE Trans. on Information Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref15","doi-asserted-by":"crossref","unstructured":"[16] S. T. Brink, G. Kramer, and A. Ashikhmin, \"Design of low-density parity-check codes for modulation and detection,\" IEEE Trans. on Communications, vol. 52, no. 4, pp. 670-678, April 2004.","DOI":"10.1109\/TCOMM.2004.826370"},{"key":"ref16","doi-asserted-by":"crossref","unstructured":"[17] M. Karimi and A. H. Banihashemi, \"A message-passing algorithm for counting short cycles in a graph,\" IEEE Information Workshop, vol. 61, no. 2, pp. 1-17, Jan. 2010.","DOI":"10.1109\/ITWKSPS.2010.5503171"},{"key":"ref17","unstructured":"[18] Y. Mao and A. H. Banihashemi, \"A heuristic search for good Low-density Parity-check codes at short block lengths,\" in Proc. IEEE International Conf. on Communications, Beijing, 2001, pp. 41-44."},{"key":"ref18","doi-asserted-by":"crossref","unstructured":"[19] L. Yang, H. Liu, and C. J. R. Shi, \"Cyclic elimination method to construct VLSI oriented LDPC codes, in Proc. IEEE Vehicular Technology Conf., Dallas, 2005, pp. 522-526.","DOI":"10.1109\/VETECF.2005.1557966"},{"key":"ref19","doi-asserted-by":"crossref","unstructured":"[20] T. Richardson and R. Urbanke, \"The capacity of low density parity check codes under message passing decoding,\" IEEE Trans. on Information Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.","DOI":"10.1109\/18.910577"},{"key":"ref20","doi-asserted-by":"crossref","unstructured":"[21] J. G. Yuan, L. Xu, and Q. Tong, \"A novel QC-LDPC code based on the finite field multiplicative group for optical communications,\" Optoelectronics Letters, vol. 9, pp. 287-380, Sep. 2013.","DOI":"10.1007\/s11801-013-3102-7"},{"key":"ref21","doi-asserted-by":"crossref","unstructured":"[22] J. Wang, G. Zhang, and Q. Zhou, \"Coset-based QC-LDPC codes without small cycles,\" IEEE Electronics Letters, vol. 50, no. 22, pp. 1597-1598, Oct. 2014.","DOI":"10.1049\/el.2014.2121"},{"key":"ref22","doi-asserted-by":"crossref","unstructured":"[23] L. J. Kong and Y. Xiao, \"Design of good QC-LDPC codes without small girth in the p-plane,\" Journal of Systems Engineering and Electronics, vol. 22, no. 2, pp. 183-187, April 2011.","DOI":"10.3969\/j.issn.1004-4132.2011.02.001"}],"container-title":["Journal of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.jocm.us\/uploadfile\/2016\/1026\/20161026115807795.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T22:01:56Z","timestamp":1749852116000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jocm.us\/index.php?m=content&c=index&a=show&catid=167&id=1042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":23,"URL":"https:\/\/doi.org\/10.12720\/jcm.11.10.936-943","relation":{},"ISSN":["2374-4367"],"issn-type":[{"type":"print","value":"2374-4367"}],"subject":[],"published":{"date-parts":[[2016]]}}}