{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:57:58Z","timestamp":1760576278730,"version":"build-2065373602"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T00:00:00Z","timestamp":1752364800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T00:00:00Z","timestamp":1752364800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["No. 2023YFA1009602","No. 2023YFA1009602","No. 2023YFA1009602","No. 2023YFA1009602"],"award-info":[{"award-number":["No. 2023YFA1009602","No. 2023YFA1009602","No. 2023YFA1009602","No. 2023YFA1009602"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s10623-025-01691-z","type":"journal-article","created":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T14:41:05Z","timestamp":1752417665000},"page":"4501-4514","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the lifting degree of girth-8 QC-LDPC codes"],"prefix":"10.1007","volume":"93","author":[{"given":"Haoran","family":"Xiong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanghui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiming","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guiying","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,13]]},"reference":[{"key":"1691_CR1","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 6, 23688\u201323700 (2018).","journal-title":"IEEE Access"},{"issue":"4","key":"1691_CR2","doi-asserted-by":"publisher","first-page":"2265","DOI":"10.1109\/TIT.2011.2176717","volume":"58","author":"IE Bocharova","year":"2012","unstructured":"Bocharova I.E., Hug F., Johannesson R., Kudryashov B.D., Satyukov R.V.: Searching for voltage graph-based LDPC tailbiting codes with large girth. IEEE Trans. Inf. Theory 58(4), 2265\u20132279 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1691_CR3","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/4234.1001666","volume":"6","author":"J Chen","year":"2002","unstructured":"Chen J., Fossorier M.P.C.: Density evolution for two improved BP-based decoding algorithms of LDPC codes. IEEE Commun. Lett. 6(5), 208\u2013210 (2002).","journal-title":"IEEE Commun. Lett."},{"issue":"6","key":"1691_CR4","doi-asserted-by":"publisher","first-page":"4438","DOI":"10.1109\/TIT.2018.2805906","volume":"64","author":"A Dehghan","year":"2018","unstructured":"Dehghan A., Banihashemi A.H.: On the Tanner graph cycle distribution of random LDPC, random protograph-based LDPC, and random quasi-cyclic LDPC code ensembles. IEEE Trans. Inf. Theory 64(6), 4438\u20134451 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1691_CR5","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.: Quasicyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans. Inf. Theory 50(8), 1788\u20131793 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1691_CR6","doi-asserted-by":"publisher","first-page":"4542","DOI":"10.1109\/TIT.2013.2251395","volume":"59","author":"M Karimi","year":"2013","unstructured":"Karimi M., Banihashemi A.H.: On the girth of quasi-cyclic protograph LDPC codes. IEEE Trans. Inf. Theory 59(7), 4542\u20134552 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1691_CR7","doi-asserted-by":"publisher","first-page":"7288","DOI":"10.1109\/TIT.2013.2279831","volume":"59","author":"K-J Kim","year":"2013","unstructured":"Kim K.-J., Chung J.-H., Yang K.: Bounds on the size of parity-check matrices for quasi-cyclic low-density parity-check codes. IEEE Trans. Inf. Theory 59(11), 7288\u20137298 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1691_CR8","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1109\/LCOMM.2022.3159560","volume":"26","author":"I Kim","year":"2022","unstructured":"Kim I., Kojima T., Song H.-Y.: Some short-length girth-8 QC-LDPC codes from primes of the form $$t^2 + 1$$. IEEE Commun. Lett. 26(6), 1211\u20131215 (2022).","journal-title":"IEEE Commun. Lett."},{"issue":"8","key":"1691_CR9","doi-asserted-by":"publisher","first-page":"2626","DOI":"10.1109\/TCOMM.2014.2339329","volume":"62","author":"J Li","year":"2014","unstructured":"Li J., Liu K., Lin S., Abdel-Ghaffar K.: Algebraic quasi-cyclic LDPC codes: construction, low error-floor, large girth and a reduced-complexity decoding scheme. IEEE Trans. Commun. 62(8), 2626\u20132637 (2014).","journal-title":"IEEE Trans. Commun."},{"key":"1691_CR10","unstructured":"NR.: Multiplexing Channel Coding (Release16). Document TS 38.212 v16.7.0, 3GPP (2021)."},{"key":"1691_CR11","doi-asserted-by":"crossref","unstructured":"Okamura T.: Designing LDPC codes using cyclic shifts. In: 2003 IEEE International Symposium on Information Theory (ISIT), p. 151 (2003).","DOI":"10.1109\/ISIT.2003.1228165"},{"key":"1691_CR12","doi-asserted-by":"crossref","unstructured":"Ranganathan S.V., Divsalar D., Wesel R.D.: On the girth of $$(3, L)$$ quasi-cyclic LDPC codes based on complete protographs. In: 2015 IEEE International Symposium on Information Theory (ISIT), pp. 431\u2013435 (2015).","DOI":"10.1109\/ISIT.2015.7282491"},{"issue":"6","key":"1691_CR13","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1109\/LCOMM.2018.2827959","volume":"22","author":"MH Tadayon","year":"2018","unstructured":"Tadayon M.H., Tasdighi A., Battaglioni M., Baldi M., Chiaraluce F.: Efficient search of compact QC-LDPC and SC-LDPC convolutional codes with large girth. IEEE Commun. Lett. 22(6), 1156\u20131159 (2018).","journal-title":"IEEE Commun. Lett."},{"issue":"1","key":"1691_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.2021.3116655","volume":"68","author":"A Tasdighi","year":"2021","unstructured":"Tasdighi A., Boutillon E.: Integer ring sieve for constructing compact QC-LDPC codes with girths 8, 10, and 12. IEEE Trans. Inf. Theory 68(1), 35\u201346 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1691_CR15","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. Inf. Theory 62(4), 1552\u20131564 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1691_CR16","first-page":"14","volume":"65","author":"A Tasdighi","year":"2017","unstructured":"Tasdighi A., Banihashemi A.H., Sadeghi M.-R.: Symmetrical constructions for regular girth-8 QC-LDPC codes. IEEE Trans. Commun. 65(1), 14\u201322 (2017).","journal-title":"IEEE Trans. Commun."},{"issue":"2","key":"1691_CR17","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/TIT.1967.1053974","volume":"13","author":"R Townsend","year":"1967","unstructured":"Townsend R., Weldon E.: Self-orthogonal quasi-cyclic codes. IEEE Trans. Inf. Theory 13(2), 183\u2013195 (1967).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1691_CR18","doi-asserted-by":"crossref","unstructured":"Wang Y., Yedidia J.S., Draper S.C.: Construction of high-girth QC-LDPC codes. In: 2008 5th International Symposium on Turbo Codes and Related Topics, pp. 180\u2013185 (2008).","DOI":"10.1109\/TURBOCODING.2008.4658694"},{"key":"1691_CR19","doi-asserted-by":"crossref","unstructured":"Zhang G., Sun A., Liu L., Fang Y.: Short regular girth-8 QC-LDPC codes from exponent matrices with vertical symmetry. In: 2024 IEEE International Symposium on Information Theory (ISIT), pp. 647\u2013652 (2024).","DOI":"10.1109\/ISIT57864.2024.10619229"},{"issue":"4","key":"1691_CR20","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/LCOMM.2014.030114.132853","volume":"18","author":"J Zhang","year":"2014","unstructured":"Zhang J., Zhang G.: Deterministic girth-eight QC-LDPC codes with large column weight. IEEE Commun. Lett. 18(4), 656\u2013659 (2014).","journal-title":"IEEE Commun. Lett."},{"issue":"9","key":"1691_CR21","doi-asserted-by":"publisher","first-page":"1822","DOI":"10.1109\/LCOMM.2013.070913.130966","volume":"17","author":"G Zhang","year":"2013","unstructured":"Zhang G., Sun R., Wang X.: Several explicit constructions for $$(3, L)$$ QC-LDPC codes with girth at least eight. IEEE Commun. Lett. 17(9), 1822\u20131825 (2013).","journal-title":"IEEE Commun. Lett."},{"issue":"9","key":"1691_CR22","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1109\/LCOMM.2019.2925792","volume":"23","author":"G Zhang","year":"2019","unstructured":"Zhang G., Fang Y., Liu Y.: Automatic verification of GCD constraint for construction of girth-eight QC-LDPC codes. IEEE Commun. Lett. 23(9), 1453\u20131456 (2019).","journal-title":"IEEE Commun. Lett."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01691-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01691-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01691-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T18:03:35Z","timestamp":1760551415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01691-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,13]]},"references-count":22,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["1691"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01691-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,7,13]]},"assertion":[{"value":"17 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing financial interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}