{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:21:14Z","timestamp":1751516474441,"version":"3.41.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319781297"},{"type":"electronic","value":"9783319781303"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78130-3_48","type":"book-chapter","created":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T14:54:31Z","timestamp":1521471271000},"page":"460-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Construction of Quasi-Cyclic LDPC Codes with Diagonal Structure of\u00a0Parity-Check Matrices"],"prefix":"10.1007","author":[{"given":"Hengzhou","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoming","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,20]]},"reference":[{"key":"48_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R Gallager","year":"1962","unstructured":"Gallager, R.: Low-density parity-check codes. IRE Trans. Inf. Theory 8, 21\u201328 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1049\/el:19961141","volume":"32","author":"D MacKay","year":"1996","unstructured":"MacKay, D., Neal, R.: Near shannon limit performance of low density parity-check codes. Electron. Lett. 32, 1645\u20131646 (1996)","journal-title":"Electron. Lett."},{"key":"48_CR3","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"D MacKay","year":"1999","unstructured":"MacKay, D.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory 45, 399\u2013431 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"48_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253","volume-title":"Channel Codes: Classical and Modern","author":"WE Ryan","year":"2009","unstructured":"Ryan, W.E., Lin, S.: Channel Codes: Classical and Modern. Cambridge University Press, New York (2009)"},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1007\/s10586-016-0593-6","volume":"19","author":"H Zhou","year":"2016","unstructured":"Zhou, H., Li, Q., Tong, W., Kausar, S., Zhu, H.: P-Aware: a proportional multi-resource scheduling strategy in cloud data center. Clust. Comput. 19, 1089\u20131103 (2016)","journal-title":"Clust. Comput."},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"1788","DOI":"10.1109\/TIT.2004.831841","volume":"50","author":"MPC Fossorier","year":"2004","unstructured":"Fossorier, M.P.C.: Quasi-cyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans. Inf. Theory 50, 1788\u20131793 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"2648","DOI":"10.1109\/TIT.2011.2179842","volume":"58","author":"Q Huang","year":"2012","unstructured":"Huang, Q., Diao, Q., Lin, S., Abdel-Ghaffar, K.: Cyclic and quasi-cyclic LDPC codes on constrained parity-check matrices and their trapping sets. IEEE Trans. Inf. Theory 58, 2648\u20132671 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"Zhang, L., Lin, S., Abdel-Ghaffar, K., Zhou, B.: Circulant arrays: rank analysis and construction of quasi-cyclic LDPC codes. In: 2010 IEEE International Symposium on Information Theory, pp. 814\u2013818. IEEE Press, New York (2010)","DOI":"10.1109\/ISIT.2010.5513640"},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"Li, J., Liu, K., Lin, S., Abdel-Ghaffar, K.: Quasi-cyclic LDPC codes on two arbitrary sets of a finite field. In: 2014 IEEE International Symposium on Information Theory, pp. 2454\u20132458. IEEE Press, New York (2014)","DOI":"10.1109\/ISIT.2014.6875275"},{"key":"48_CR10","unstructured":"Digital Video Broadcasting (DVB), Europe Telecommunication Standards Institution (2009)"},{"key":"48_CR11","unstructured":"Short Block Length LDPC Codes for TC Synchronization and Channel Coding, CCSDS 231.1-O-1 (2015)"},{"key":"48_CR12","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1049\/el.2013.2390","volume":"50","author":"P Zhang","year":"2014","unstructured":"Zhang, P., Yu, S., Liu, C., Jiang, L.: Efficient encoding of QC-LDPC codes with multiple-diagonal parity-check structure. Electron. Lett. 50, 320\u2013321 (2014)","journal-title":"Electron. Lett."},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1049\/el:19990065","volume":"35","author":"P Li","year":"1999","unstructured":"Li, P., Leung, W.K., Phamdo, N.: Low density parity check codes with semi-random parity check matrix. Electron. Lett. 35, 38\u201339 (1999)","journal-title":"Electron. Lett."},{"key":"48_CR14","unstructured":"3GPP TSG RAN WG1 Meeting $$\\sharp $$87: RAN1 Chairmans Notes (2016)"},{"key":"48_CR15","unstructured":"Air Interface for Fixed Broadband Wireless Access Systems, IEEE Standard P802.16e\/D12 (2005)"},{"key":"48_CR16","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/TIT.2015.2496213","volume":"62","author":"I Bocharova","year":"2016","unstructured":"Bocharova, I., Kudryashov, B., Johannesson, R.: Searching for binary and nonbinary block and convolutional LDPC codes. IEEE Trans. Inf. Theory 62, 163\u2013183 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"48_CR17","doi-asserted-by":"publisher","first-page":"2330","DOI":"10.1109\/TCOMM.2011.060911.100208","volume":"59","author":"L Zhang","year":"2011","unstructured":"Zhang, L., Lin, S., Abdel-Ghaffar, K., Ding, Z., Zhou, B.: Quasi-cyclic LDPC codes on cyclic subgroups of finite fields. IEEE Trans. Commun. 59, 2330\u20132336 (2011)","journal-title":"IEEE Trans. Commun."},{"key":"48_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TCOMM.2008.050483","volume":"56","author":"L Lan","year":"2008","unstructured":"Lan, L., Tai, Y., Lin, S., Memari, B., Honary, B.: New constructions of quasi-cyclic LDPC codes based on special classes of BIBD\u2019s for the AWGN and binary erasure channels. IEEE Trans. Commun. 56, 39\u201348 (2008)","journal-title":"IEEE Trans. Commun."},{"key":"48_CR19","doi-asserted-by":"publisher","first-page":"1640","DOI":"10.1109\/TCOMM.2013.021513.120013","volume":"61","author":"H Falsafain","year":"2013","unstructured":"Falsafain, H., Esmaeili, M.: Construction of structured regular LDPC codes: a design-theoretic approach. IEEE Trans. Commun. 61, 1640\u20131647 (2013)","journal-title":"IEEE Trans. Commun."},{"key":"48_CR20","doi-asserted-by":"crossref","unstructured":"Xu, H., Feng, D., Sun, C., Bai, B.: Construction of LDPC codes based on resolvable group divisible designs. In: 2015 International Workshop on High Mobility Wireless Communications, pp. 111\u2013115. IEEE Press, New York (2015)","DOI":"10.1109\/HMWC.2015.7354346"},{"key":"48_CR21","doi-asserted-by":"publisher","first-page":"7898","DOI":"10.1109\/TIT.2013.2280640","volume":"59","author":"Q Diao","year":"2013","unstructured":"Diao, Q., Tai, Y., Lin, S., Abdel-Ghaffar, K.: LDPC codes on partial geometries: construction, trapping set structure, and puncturing. IEEE Trans. Inf. Theory 59, 7898\u20137914 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"48_CR22","doi-asserted-by":"publisher","first-page":"2947","DOI":"10.1109\/TIT.2015.2508455","volume":"62","author":"Q Diao","year":"2016","unstructured":"Diao, Q., Li, J., Lin, S., Blake, I.F.: New classes of partial geometries and their associated LDPC codes. IEEE Trans. Inf. Theory 62, 2947\u20132965 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"48_CR23","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"RM Tanner","year":"1981","unstructured":"Tanner, R.M.: A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27, 533\u2013547 (1981)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"48_CR24","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.1109\/TIT.2016.2523979","volume":"62","author":"A Tasdighi","year":"2016","unstructured":"Tasdighi, A., Banihashemi, A.H., Sadeghi, M.: Efficient search of girth-optimal QC-LDPC codes. IEEE Trans. Inf. Theory 62, 1552\u20131564 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"48_CR25","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/LCOMM.2015.2494581","volume":"20","author":"S Zhao","year":"2016","unstructured":"Zhao, S., Ma, X.: Construction of high-performance array-based non-binary LDPC codes with moderate rates. IEEE Commun. Lett. 20, 13\u201316 (2016)","journal-title":"IEEE Commun. Lett."},{"key":"48_CR26","doi-asserted-by":"crossref","unstructured":"Liu, Y., Li, Y.: Design of masking matrix for QC-LDPC codes. In: IEEE Information Theory Workshop, pp. 1\u20135. IEEE Press, New York (2013)","DOI":"10.1109\/ITW.2013.6691248"},{"key":"48_CR27","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/LCOMM.2015.2494581","volume":"20","author":"H Xu","year":"2016","unstructured":"Xu, H., Feng, D., Luo, R., Bai, B.: Construction of quasi-cyclic LDPC codes via masking with successive cycle elimination. IEEE Commun. Lett. 20, 13\u201316 (2016)","journal-title":"IEEE Commun. Lett."},{"key":"48_CR28","doi-asserted-by":"crossref","unstructured":"Sun, C., Xu, H., Feng, D., Bai, B.: (3, L) Quasi-cyclic LDPC codes: simplified exhaustive search and designs. In: 2016 9th International Symposium on Turbo Codes and Iterative Information Processing, pp. 271\u2013275. IEEE Press, New York (2016)","DOI":"10.1109\/ISTC.2016.7593119"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78130-3_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T21:42:24Z","timestamp":1751492544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-78130-3_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319781297","9783319781303"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78130-3_48","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"20 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ChinaCom","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Communications and Networking in China","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"chinacom2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/chinacom.eai-conferences.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}