{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:19:25Z","timestamp":1761293965898,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T00:00:00Z","timestamp":1564704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T00:00:00Z","timestamp":1564704000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10623-019-00667-0","type":"journal-article","created":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T16:02:55Z","timestamp":1564761775000},"page":"41-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Construction of girth-8 (3,L)-QC-LDPC codes of smallest CPM size using column multipliers"],"prefix":"10.1007","volume":"88","author":[{"given":"Jasvinder","family":"Singh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9335-1058","authenticated-orcid":false,"given":"Manish","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"Jaskarn Singh","family":"Bhullar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,2]]},"reference":[{"key":"667_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."},{"unstructured":"Draft DVB-S2 Standard: ETSI EN 302 307-1 V1.4.1. \nhttps:\/\/www.dvb.org\/standards\/dvb-s2\n\n (2014). Accessed 23 January 2018.","key":"667_CR2"},{"issue":"8","key":"667_CR3","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(8), 1788\u20131793 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"667_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s40995-016-0008-9","volume":"40","author":"M Gholami","year":"2016","unstructured":"Gholami M., Gholami Z.: An explicit method to generate some QC-LDPC codes with girth 8. Iran. J. Sci. Technol. Trans. A Sci. 40(2), 145\u2013149 (2016).","journal-title":"Iran. J. Sci. Technol. Trans. A Sci."},{"issue":"7","key":"667_CR5","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":"2","key":"667_CR6","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1109\/TCOMM.2016.2633343","volume":"65","author":"H Khodaiemehr","year":"2017","unstructured":"Khodaiemehr H., Sadeghi M.R., Sakzad A.: Practical encoder and decoder for power constrained QC LDPC-lattice codes. IEEE Trans. Commun. 65(2), 486\u2013500 (2017).","journal-title":"IEEE Trans. Commun."},{"issue":"11","key":"667_CR7","doi-asserted-by":"publisher","first-page":"7288","DOI":"10.1109\/TIT.2013.2279831","volume":"59","author":"KJ 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":"5","key":"667_CR8","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/s11801-017-7082-x","volume":"13","author":"L Li","year":"2017","unstructured":"Li L., Li H., Li J., Jiang H.: Construction of type-II QC-LDPC codes with fast encoding based on perfect cyclic difference sets. Optoelectron. Lett. 13(5), 358\u2013362 (2017).","journal-title":"Optoelectron. Lett."},{"key":"667_CR9","first-page":"41","volume":"1","author":"Y Mao","year":"2001","unstructured":"Mao Y., Banihashemi A.H.: A heuristic search for good low-density parity-check codes at short block lengths. Proc. IEEE ICC. 1, 41\u201344 (2001).","journal-title":"Proc. IEEE ICC."},{"issue":"1\u20133","key":"667_CR10","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/B:DESI.0000029233.20866.41","volume":"32","author":"KE Mellinger","year":"2004","unstructured":"Mellinger K.E.: LDPC codes from triangle-free line sets. Des. Codes Cryptogr. 32(1\u20133), 341\u2013350 (2004).","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"667_CR11","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1109\/LCOMM.2018.2841873","volume":"22","author":"M Sadeghi","year":"2018","unstructured":"Sadeghi M., Amirzade F.: Analytical lower bound on the lifting degree of multiple-edge QC-LDPC codes with girth 6. IEEE Commun. Lett. 22(8), 1528\u20131531 (2018).","journal-title":"IEEE Commun. Lett."},{"issue":"1","key":"667_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10623-009-9349-0","volume":"57","author":"A Sakzad","year":"2010","unstructured":"Sakzad A., Sadeghi M., Panario D.: Codes with girth 8 tanner graph representation. Des. Codes Cryptogr. 57(1), 71\u201381 (2010).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"667_CR13","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":"667_CR14","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":"3","key":"667_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10623-009-9324-9","volume":"54","author":"P Vandendriessche","year":"2010","unstructured":"Vandendriessche P.: Some low-density parity-check codes derived from finite geometries. Des. Codes Cryptogr. 54(3), 287\u2013297 (2010).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"667_CR16","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/s11801-016-5238-8","volume":"12","author":"J Yuan","year":"2016","unstructured":"Yuan J., Liang M., Wang Y., Lin J., Pang Y.: A novel construction method of QC-LDPC codes based on CRT for optical communications. Optoelectron. Lett. 12(3), 208\u2013211 (2016).","journal-title":"Optoelectron. Lett."},{"issue":"2","key":"667_CR17","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1109\/LCOMM.2012.122012.122292","volume":"17","author":"G Zhang","year":"2013","unstructured":"Zhang G., Sun R., Wang X.: Construction of girth-eight QC-LDPC codes from greatest common divisor. IEEE Commun. Lett. 17(2), 369\u2013372 (2013).","journal-title":"IEEE Commun. Lett."},{"issue":"9","key":"667_CR18","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":"4","key":"667_CR19","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":"6","key":"667_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-013-4971-x","volume":"57","author":"L Zhang","year":"2014","unstructured":"Zhang L., Li B., Cheng L.: Constructions of QC-LDPC codes based on integer sequences. Sci. China Inf. Sci. 57(6), 1\u201314 (2014).","journal-title":"Sci. China Inf. Sci."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00667-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00667-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00667-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T09:15:15Z","timestamp":1596273315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00667-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,2]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["667"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00667-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2019,8,2]]},"assertion":[{"value":"26 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}