{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:05:51Z","timestamp":1761663951526},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T00:00:00Z","timestamp":1560470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T00:00:00Z","timestamp":1560470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s11432-018-9778-x","type":"journal-article","created":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T09:02:36Z","timestamp":1560762156000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two classes of QC-LDPC cycle codes approaching Gallager lower bound"],"prefix":"10.1007","volume":"62","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":"Mengmeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,14]]},"reference":[{"key":"9778_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1109\/TCOMM.2014.2387341","volume":"63","author":"C Chen","year":"2015","unstructured":"Chen C, Bai B, Shi G, et al. Nonbinary LDPC codes on cages: structural property and code optimization. IEEE Trans Commun, 2015, 63: 364\u2013375","journal-title":"IEEE Trans Commun"},{"key":"9778_CR2","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1109\/TCOMM.2015.2403856","volume":"63","author":"J Li","year":"2015","unstructured":"Li J, Liu K, Lin S, et al. A matrix-theoretic approach to the construction of non-binary quasi-cyclic LDPC codes. IEEE Trans Commun, 2015, 63: 1057\u20131068","journal-title":"IEEE Trans Commun"},{"key":"9778_CR3","doi-asserted-by":"publisher","first-page":"4910","DOI":"10.1109\/TCOMM.2016.2609906","volume":"64","author":"S Zhao","year":"2016","unstructured":"Zhao S, Huang X, Ma X. Structural analysis of arraybased non-binary LDPC codes. IEEE Trans Commun, 2016, 64: 4910\u20134922","journal-title":"IEEE Trans Commun"},{"key":"9778_CR4","doi-asserted-by":"publisher","first-page":"5110","DOI":"10.1109\/TCOMM.2017.2746101","volume":"65","author":"Q Huang","year":"2017","unstructured":"Huang Q, Song L, Wang Z. Set message-passing decoding algorithms for regular non-binary LDPC codes. IEEE Trans Commun, 2017, 65: 5110\u20135122","journal-title":"IEEE Trans Commun"},{"key":"9778_CR5","doi-asserted-by":"publisher","first-page":"089303","DOI":"10.1007\/s11432-017-9271-6","volume":"61","author":"H Xu","year":"2018","unstructured":"Xu H, Chen C, Zhu M, et al. Nonbinary LDPC cycle codes: efficient search, design, and code optimization. Sci China Inf Sci, 2018, 61: 089303","journal-title":"Sci China Inf Sci"},{"key":"9778_CR6","doi-asserted-by":"publisher","first-page":"2885","DOI":"10.1109\/TIT.2007.901193","volume":"53","author":"S Kim","year":"2007","unstructured":"Kim S, No J, Chung H, et al. Quasi-cyclic low-density parity-check codes with girth larger than 12. IEEE Trans Inform Theor, 2007, 53: 2885\u20132891","journal-title":"IEEE Trans Inform Theor"},{"key":"9778_CR7","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 R. Efficient search of girth-optimal QC-LDPC codes. IEEE Trans Inform Theor, 2016, 62: 1552\u20131564","journal-title":"IEEE Trans Inform Theor"},{"key":"9778_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/LCOMM.2010.02.092121","volume":"14","author":"C Chen","year":"2010","unstructured":"Chen C, Bai B, Wang X. Construction of nonbinary quasi-cyclic LDPC cycle codes based on singer perfect difference set. IEEE Commun Lett, 2010, 14: 181\u2013183","journal-title":"IEEE Commun Lett"},{"key":"9778_CR9","doi-asserted-by":"publisher","first-page":"23688","DOI":"10.1109\/ACCESS.2018.2830406","volume":"6","author":"F Amirzade","year":"2018","unstructured":"Amirzade F, Sadeghi M R. Lower bounds on the lifting degree of QC-LDPC codes by difference matrices. IEEE Access, 2018, 6: 23688\u201323700","journal-title":"IEEE Access"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9778-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-018-9778-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9778-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T11:19:25Z","timestamp":1681384765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-018-9778-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,14]]},"references-count":9,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["9778"],"URL":"https:\/\/doi.org\/10.1007\/s11432-018-9778-x","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,14]]},"assertion":[{"value":"18 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"209305"}}