{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T07:23:59Z","timestamp":1757575439844},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T00:00:00Z","timestamp":1574812800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T00:00:00Z","timestamp":1574812800000},"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":["Cryptogr. Commun."],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s12095-019-00405-2","type":"journal-article","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T12:03:17Z","timestamp":1574856197000},"page":"711-723","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the search of smallest QC-LDPC code with girth six and eight"],"prefix":"10.1007","volume":"12","author":[{"given":"Jasvinder","family":"Singh","sequence":"first","affiliation":[]},{"given":"Manish","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"Jaskarn Singh","family":"Bhullar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,27]]},"reference":[{"issue":"1","key":"405_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"RG Gallager","year":"1962","unstructured":"Gallager, R.G.: Low-density parity-check codes. IRE Transactions on Information Theory. 8(1), 21\u201328 (1962)","journal-title":"IRE Transactions on Information Theory."},{"issue":"18","key":"405_CR2","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1049\/el:19961141","volume":"32","author":"DJC Mackay","year":"1996","unstructured":"Mackay, D.J.C., Neal, R.M.: Near shannon limit performance of low density parity check codes. Electron. Lett. 32(18), 1645\u20131645 (1996)","journal-title":"Electron. Lett."},{"key":"405_CR3","unstructured":"Berrou C., Glavieus A., Thitimajshima P.: Near shannon limit error-correcting coding and decoding: turbo-codes 1. IEEE International Conference on Communications. In: Proceeding of IEEE International Conference on Communications. (1993). 10.1109\/icc.1993.397441"},{"issue":"9","key":"405_CR4","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1109\/LCOMM.2005.1506715","volume":"9","author":"S Myung","year":"2005","unstructured":"Myung, S., Yang, K.: A combining method of quasi-cyclic LDPC codes by the chinese remainder theorem. IEEE Commun. Lett. 9(9), 823\u2013825 (2005)","journal-title":"IEEE Commun. Lett."},{"issue":"5","key":"405_CR5","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(5), 533\u2013547 (1981)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"405_CR6","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s11277-016-3465-8","volume":"91","author":"A Bajpai","year":"2016","unstructured":"Bajpai, A., Srirutchataboon, G., Kovintavewat, P.: Wuttisittikulkij L: A new construction method for large girth quasi-cyclic LDPC codes with optimized lower bound using chinese remainder theorem. Wirel. Pers. Commun. 91(1), 369\u2013381 (2016)","journal-title":"Wirel. Pers. Commun."},{"issue":"2","key":"405_CR7","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. Iranian Journal of Science and Technology, Transactions A: Science. 40(2), 145\u2013149 (2016)","journal-title":"Iranian Journal of Science and Technology, Transactions A: Science."},{"issue":"7","key":"405_CR8","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":"1\u20133","key":"405_CR9","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 Crypt. 32(1\u20133), 341\u2013350 (2004)","journal-title":"Des. Codes Crypt."},{"issue":"1","key":"405_CR10","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 Crypt. 57(1), 71\u201381 (2010)","journal-title":"Des. Codes Crypt."},{"issue":"4","key":"405_CR11","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":"405_CR12","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."},{"key":"405_CR13","doi-asserted-by":"publisher","DOI":"10.1109\/turbocoding.2008.4658694","volume-title":"Proceeding of 5th International Symposium on Turbo Codes and Related Topics","author":"Y Wang","year":"2007","unstructured":"Wang, Y., Yedidia, J.S., Draper, S.C.: Construction of high-girth QC-LDPC codes. In: Proceeding of 5th International Symposium on Turbo Codes and Related Topics (2007). https:\/\/doi.org\/10.1109\/turbocoding.2008.4658694"},{"issue":"9","key":"405_CR14","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":"405_CR15","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 Communications Letters. 18(4), 656\u2013659 (2014)","journal-title":"IEEE Communications Letters."},{"issue":"6","key":"405_CR16","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. SCIENCE CHINA Inf. Sci. 57(6), 1\u201314 (2014)","journal-title":"SCIENCE CHINA Inf. Sci."},{"issue":"8","key":"405_CR17","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":"5","key":"405_CR18","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."},{"issue":"2","key":"405_CR19","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1109\/TIT.2005.862120","volume":"52","author":"ME O'sullivan","year":"2006","unstructured":"O'sullivan, M.E.: Algebraic construction of sparse matrices with large girth. IEEE Trans. Inf. Theory. 52(2), 718\u2013727 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"405_CR20","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 Crypt. 54(3), 287\u2013297 (2010)","journal-title":"Des. Codes Crypt."},{"issue":"3","key":"405_CR21","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":"405_CR22","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":"4","key":"405_CR23","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.: 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":"11","key":"405_CR24","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"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-019-00405-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-019-00405-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-019-00405-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T01:41:57Z","timestamp":1606354917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-019-00405-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,27]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["405"],"URL":"https:\/\/doi.org\/10.1007\/s12095-019-00405-2","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,27]]},"assertion":[{"value":"23 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}