{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:48:07Z","timestamp":1773931687535,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T00:00:00Z","timestamp":1690243200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T00:00:00Z","timestamp":1690243200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000171","name":"Division of Human Resource Development","doi-asserted-by":"publisher","award":["1914635"],"award-info":[{"award-number":["1914635"]}],"id":[{"id":"10.13039\/100000171","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["2145917"],"award-info":[{"award-number":["2145917"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000148","name":"Division of Electrical, Communications and Cyber Systems","doi-asserted-by":"crossref","award":["CCSS-2027844"],"award-info":[{"award-number":["CCSS-2027844"]}],"id":[{"id":"10.13039\/100000148","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000148","name":"Division of Electrical, Communications and Cyber Systems","doi-asserted-by":"crossref","award":["CCSS-2052751"],"award-info":[{"award-number":["CCSS-2052751"]}],"id":[{"id":"10.13039\/100000148","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"crossref","award":["2100013"],"award-info":[{"award-number":["2100013"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"crossref","award":["CIF-2106189"],"award-info":[{"award-number":["CIF-2106189"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"crossref","award":["CIF-1855879"],"award-info":[{"award-number":["CIF-1855879"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100006196","name":"Jet Propulsion Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006196","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It is well known that some harmful objects in the Tanner graph of low-density parity-check (LDPC) codes have a negative impact on their error correction performance under iterative message-passing decoding. Depending on the channel and the decoding algorithm, these harmful objects are different in nature and can be stopping sets, trapping sets, absorbing sets, or pseudocodewords. Differently from LDPC block codes, the design of spatially coupled LDPC codes must take into account the semi-infinite nature of the code, while still reducing the number of harmful objects as much as possible. We propose a general procedure, based on <jats:italic>edge spreading<\/jats:italic>, enabling the design of good quasi-cyclic spatially coupled LDPC (QC-SC-LDPC) codes. These codes are derived from quasi-cyclic LDPC (QC-LDPC) block codes and contain a considerably reduced number of harmful objects with respect to the original QC-LDPC block codes. We use an efficient way of enumerating harmful objects in QC-SC-LDPCCs to obtain a fast algorithm that spans the search space of potential candidates to select those minimizing the multiplicity of the target harmful objects. We validate the effectiveness of our method via numerical simulations, showing that the newly designed codes achieve better error rate performance than codes presented in previous literature.<\/jats:p>","DOI":"10.1186\/s13638-023-02273-0","type":"journal-article","created":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T07:01:38Z","timestamp":1690268498000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimizing quasi-cyclic spatially coupled LDPC codes by eliminating harmful objects"],"prefix":"10.1186","volume":"2023","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8539-4007","authenticated-orcid":false,"given":"Massimo","family":"Battaglioni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco","family":"Chiaraluce","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Baldi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Pacenti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David G. M.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,25]]},"reference":[{"issue":"6","key":"2273_CR1","doi-asserted-by":"publisher","first-page":"2181","DOI":"10.1109\/18.782171","volume":"45","author":"A Jim\u00e9nez Felstr\u00f6m","year":"1999","unstructured":"A. Jim\u00e9nez Felstr\u00f6m, K.S. Zigangirov, Time-varying periodic convolutional codes with low-density parity-check matrix. IEEE Trans. Inf. Theory 45(6), 2181\u20132191 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2273_CR2","doi-asserted-by":"crossref","unstructured":"R.G. Gallager, Low-density parity-check codes. IRE Trans. Inform. Theory IT-8, 21\u201328 (1962)","DOI":"10.1109\/TIT.1962.1057683"},{"issue":"1","key":"2273_CR3","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1109\/TVT.2019.2949600","volume":"69","author":"Z Yang","year":"2020","unstructured":"Z. Yang, Y. Fang, G. Zhang, F.C.M. Lau, S. Mumtaz, D.B. da Costa, Analysis and optimization of tail-biting spatially coupled protograph LDPC codes for BICM-ID systems. IEEE Trans. Veh. Technol. 69(1), 390\u2013404 (2020). https:\/\/doi.org\/10.1109\/TVT.2019.2949600","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"4","key":"2273_CR4","doi-asserted-by":"publisher","first-page":"3493","DOI":"10.1109\/TVT.2021.3065052","volume":"70","author":"Q Wang","year":"2021","unstructured":"Q. Wang, S. Cai, W. Lin, S. Zhao, L. Chen, X. Ma, Spatially coupled LDPC codes via partial superposition and their application to HARQ. IEEE Trans. Veh. Technol. 70(4), 3493\u20133504 (2021). https:\/\/doi.org\/10.1109\/TVT.2021.3065052","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"2","key":"2273_CR5","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.910577","volume":"47","author":"TJ Richardson","year":"2001","unstructured":"T.J. Richardson, R.L. Urbanke, The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inf. Theory 47(2), 599\u2013618 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"2273_CR6","doi-asserted-by":"publisher","first-page":"5274","DOI":"10.1109\/TIT.2010.2059490","volume":"56","author":"M Lentmaier","year":"2010","unstructured":"M. Lentmaier, A. Sridharan, D.J. Costello, K.S. Zigangirov, Iterative decoding threshold analysis for LDPC convolutional codes. IEEE Trans. Inf. Theory 56(10), 5274\u20135289 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2273_CR7","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1109\/TIT.2010.2095072","volume":"57","author":"S Kudekar","year":"2011","unstructured":"S. Kudekar, T.J. Richardson, R.L. Urbanke, Threshold saturation via spatial coupling: why convolutional LDPC ensembles perform so well over the BEC. IEEE Trans. Inf. Theory 57(2), 803\u2013834 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"2273_CR8","doi-asserted-by":"publisher","first-page":"7761","DOI":"10.1109\/TIT.2013.2280915","volume":"59","author":"S Kudekar","year":"2013","unstructured":"S. Kudekar, T.J. Richardson, R.L. Urbanke, Spatially coupled ensembles universally achieve capacity under belief propagation. IEEE Trans. Inf. Theory 59(12), 7761\u20137813 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"2273_CR9","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R Tanner","year":"1981","unstructured":"R. Tanner, A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27(5), 533\u2013547 (1981)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"2273_CR10","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","volume":"48","author":"C Di","year":"2002","unstructured":"C. Di, D. Proietti, I.E. Telatar, T.J. Richardson, R.L. Urbanke, Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Trans. Inf. Theory 48(6), 1570\u20131579 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2273_CR11","unstructured":"T. Richardson, Error floors of LDPC codes, in Proceedings of 41st Annual Allerton Conference, Monticello, IL (2003)"},{"issue":"1","key":"2273_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TIT.2009.2034781","volume":"56","author":"L Dolecek","year":"2010","unstructured":"L. Dolecek, Z. Zhang, V. Anantharam, M.J. Wainwright, B. Nikolic, Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes. IEEE Trans. Inf. Theory 56(1), 181\u2013201 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"2273_CR13","doi-asserted-by":"publisher","first-page":"5188","DOI":"10.1109\/TIT.2014.2334657","volume":"60","author":"Y Hashemi","year":"2014","unstructured":"Y. Hashemi, A. Banihashemi, On characterization of elementary trapping sets of variable-regular LDPC codes. IEEE Trans. Inf. Theory 60(9), 5188\u20135203 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"2273_CR14","doi-asserted-by":"publisher","first-page":"6713","DOI":"10.1109\/TIT.2016.2613113","volume":"62","author":"Y Hashemi","year":"2016","unstructured":"Y. Hashemi, A. Banihashemi, New characterization and efficient exhaustive search algorithm for leafless elementary trapping sets of variable-regular LDPC codes. IEEE Trans. Inf. Theory 62(12), 6713\u20136736 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2273_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1109\/LCOMM.2017.2679707","volume":"22","author":"X Tao","year":"2018","unstructured":"X. Tao, Y. Li, Y. Liu, Z. Hu, On the construction of LDPC codes free of small trapping sets by controlling cycles. IEEE Commun. Lett. 22(1), 9\u201312 (2018). https:\/\/doi.org\/10.1109\/LCOMM.2017.2679707","journal-title":"IEEE Commun. Lett."},{"issue":"4","key":"2273_CR16","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1109\/TIT.2011.2110150","volume":"57","author":"R Asvadi","year":"2011","unstructured":"R. Asvadi, A.H. Banihashemi, M. Ahmadian-Attari, Lowering the error floor of LDPC codes using cyclic liftings. IEEE Trans. Inf. Theory 57(4), 2213\u20132224 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2273_CR17","doi-asserted-by":"publisher","first-page":"2280","DOI":"10.1109\/TIT.2011.2173733","volume":"58","author":"DV Nguyen","year":"2012","unstructured":"D.V. Nguyen, S.K. Chilappagari, M.W. Marcellin, B. Vasic, On the construction of structured LDPC codes free of small trapping sets. IEEE Trans. Inf. Theory 58(4), 2280\u20132302 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"2273_CR18","doi-asserted-by":"publisher","first-page":"1663","DOI":"10.1109\/TCOMM.2009.06.070325","volume":"57","author":"Y Han","year":"2009","unstructured":"Y. Han, W.E. Ryan, Low-floor decoders for LDPC codes. IEEE Trans. Commun. 57(6), 1663\u20131673 (2009). https:\/\/doi.org\/10.1109\/TCOMM.2009.06.070325","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"2273_CR19","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TCOMM.2010.101210.090628","volume":"59","author":"J Kang","year":"2011","unstructured":"J. Kang, Q. Huang, S. Lin, K. Abdel-Ghaffar, An iterative decoding algorithm with backtracking to lower the error-floors of LDPC codes. IEEE Trans. Commun. 59(1), 64\u201373 (2011). https:\/\/doi.org\/10.1109\/TCOMM.2010.101210.090628","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"2273_CR20","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1109\/TCOMM.2015.2498161","volume":"64","author":"S Kang","year":"2016","unstructured":"S. Kang, J. Moon, J. Ha, J. Shin, Breaking the trapping sets in LDPC codes: check node removal and collaborative decoding. IEEE Trans. Commun. 64(1), 15\u201326 (2016)","journal-title":"IEEE Trans. Commun."},{"issue":"9","key":"2273_CR21","doi-asserted-by":"publisher","first-page":"4866","DOI":"10.1109\/TIT.2015.2453267","volume":"61","author":"DGM Mitchell","year":"2015","unstructured":"D.G.M. Mitchell, M. Lentmaier, D.J. Costello Jr., Spatially coupled LDPC codes constructed from protographs. IEEE Trans. Inf. Theory 61(9), 4866\u20134889 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"2273_CR22","doi-asserted-by":"publisher","first-page":"2966","DOI":"10.1109\/TIT.2004.838370","volume":"50","author":"RM Tanner","year":"2004","unstructured":"R.M. Tanner, D. Sridhara, A. Sridharan, T.E. Fuja, D.J. Costello, LDPC block and convolutional codes based on circulant matrices. IEEE Trans. Inf. Theory 50(12), 2966\u20132984 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2273_CR23","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/TCOMM.2015.2500234","volume":"64","author":"AK Pradhan","year":"2016","unstructured":"A.K. Pradhan, A. Thangaraj, A. Subramanian, Construction of near-capacity protograph LDPC code sequences with block-error thresholds. IEEE Trans. Commun. 64(1), 27\u201337 (2016). https:\/\/doi.org\/10.1109\/TCOMM.2015.2500234","journal-title":"IEEE Trans. Commun."},{"issue":"11","key":"2273_CR24","doi-asserted-by":"publisher","first-page":"7235","DOI":"10.1109\/TWC.2017.2743699","volume":"16","author":"Y Fang","year":"2017","unstructured":"Y. Fang, S.C. Liew, T. Wang, Design of distributed protograph LDPC codes for multi-relay coded-cooperative networks. IEEE Trans. Wireless Commun. 16(11), 7235\u20137251 (2017). https:\/\/doi.org\/10.1109\/TWC.2017.2743699","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"2","key":"2273_CR25","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/MVT.2019.2903343","volume":"14","author":"Y Fang","year":"2019","unstructured":"Y. Fang, P. Chen, G. Cai, F.C.M. Lau, S.C. Liew, G. Han, Outage-limit-approaching channel coding for future wireless communications: Root-protograph low-density parity-check codes. IEEE Veh. Technol. Mag. 14(2), 85\u201393 (2019). https:\/\/doi.org\/10.1109\/MVT.2019.2903343","journal-title":"IEEE Veh. Technol. Mag."},{"issue":"3","key":"2273_CR26","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1109\/TCOMM.2015.2508803","volume":"64","author":"B Amiri","year":"2016","unstructured":"B. Amiri, A. Reisizadehmobarakeh, H. Esfahanizadeh, J. Kliewer, L. Dolecek, Optimized design of finite-length separable circulant-based spatially-coupled codes: an absorbing set-based analysis. IEEE Trans. Commun. 64(3), 918\u2013931 (2016)","journal-title":"IEEE Trans. Commun."},{"key":"2273_CR27","doi-asserted-by":"crossref","unstructured":"D.G.M. Mitchell, L. Dolecek, D.J. Costello, Absorbing set characterization of array-based spatially coupled LDPC codes, in Proceedings of IEEE ISIT 2014, Honolulu, HI, USA, pp. 886\u2013890 (2014)","DOI":"10.1109\/ISIT.2014.6874960"},{"key":"2273_CR28","doi-asserted-by":"crossref","unstructured":"D.G.M. Mitchell, E. Rosnes, Edge spreading design of high rate array-based SC-LDPC codes, in Proceedings of IEEE ISIT 2017, Aachen, Germany, pp. 2940\u20132944 (2017)","DOI":"10.1109\/ISIT.2017.8007068"},{"key":"2273_CR29","doi-asserted-by":"crossref","unstructured":"H. Esfahanizadeh, A. Hareedy, L. Dolecek, A novel combinatorial framework to construct spatially-coupled codes: minimum overlap partitioning, in Proceedings of IEEE ISIT 2017, Aachen, Germany, pp. 1693\u20131697 (2017)","DOI":"10.1109\/ISIT.2017.8006818"},{"key":"2273_CR30","doi-asserted-by":"crossref","unstructured":"A. Beemer, S. Habib, C.A. Kelley, J. Kliewer, A generalized algebraic approach to optimizing SC-LDPC codes, in Proceedings of 55th Annual Allerton Conference, Monticello, IL, pp. 672\u2013679 (2017)","DOI":"10.1109\/ALLERTON.2017.8262802"},{"issue":"1","key":"2273_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TCOMM.2018.2867493","volume":"67","author":"H Esfahanizadeh","year":"2019","unstructured":"H. Esfahanizadeh, A. Hareedy, L. Dolecek, Finite-length construction of high performance spatially-coupled codes via optimized partitioning and lifting. IEEE Trans. Commun. 67(1), 3\u201316 (2019). https:\/\/doi.org\/10.1109\/TCOMM.2018.2867493","journal-title":"IEEE Trans. Commun."},{"issue":"8","key":"2273_CR32","doi-asserted-by":"publisher","first-page":"4834","DOI":"10.1109\/TIT.2020.2979981","volume":"66","author":"A Hareedy","year":"2020","unstructured":"A. Hareedy, R. Wu, L. Dolecek, A channel-aware combinatorial approach to design high performance spatially-coupled codes. IEEE Trans. Inf. Theory 66(8), 4834\u20134852 (2020). https:\/\/doi.org\/10.1109\/TIT.2020.2979981","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"2273_CR33","doi-asserted-by":"publisher","first-page":"5326","DOI":"10.1109\/TCOMM.2020.3001029","volume":"68","author":"S Mo","year":"2020","unstructured":"S. Mo, L. Chen, D.J. Costello, D.G.M. Mitchell, R. Smarandache, J. Qiu, Designing protograph-based quasi-cyclic spatially coupled LDPC codes with large girth. IEEE Trans. Commun. 68(9), 5326\u20135337 (2020). https:\/\/doi.org\/10.1109\/TCOMM.2020.3001029","journal-title":"IEEE Trans. Commun."},{"key":"2273_CR34","doi-asserted-by":"publisher","unstructured":"L. Schmalen, V. Aref, F. Jardel, Non-uniformly coupled LDPC codes: Better thresholds, smaller rate-loss, and less complexity, in 2017 IEEE International Symposium on Information Theory (ISIT), pp. 376\u2013380 (2017). https:\/\/doi.org\/10.1109\/ISIT.2017.8006553","DOI":"10.1109\/ISIT.2017.8006553"},{"issue":"2","key":"2273_CR35","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1109\/TIT.2022.3207321","volume":"69","author":"S Yang","year":"2023","unstructured":"S. Yang, A. Hareedy, R. Calderbank, L. Dolecek, Breaking the computational bottleneck: Probabilistic optimization of high-memory spatially-coupled codes. IEEE Trans. Inf. Theory 69(2), 886\u2013909 (2023). https:\/\/doi.org\/10.1109\/TIT.2022.3207321","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2273_CR36","doi-asserted-by":"crossref","unstructured":"M. Battaglioni, F. Chiaraluce, M. Baldi, D.G.M. Mitchell, Efficient search and elimination of harmful objects for the optimization of QC-SC-LDPC codes, in Proceedings of IEEE GLOBECOM 2019, Waikoloa, Hawaii, USA (2019)","DOI":"10.1109\/GLOBECOM38437.2019.9013118"},{"issue":"4","key":"2273_CR37","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1109\/LCOMM.2019.2962671","volume":"24","author":"M-R Sadeghi","year":"2020","unstructured":"M.-R. Sadeghi, F. Amirzade, Edge-coloring technique to analyze elementary trapping sets of spatially-coupled LDPC convolutional codes. IEEE Commun. Lett. 24(4), 711\u2013715 (2020). https:\/\/doi.org\/10.1109\/LCOMM.2019.2962671","journal-title":"IEEE Commun. Lett."},{"key":"2273_CR38","unstructured":"J.L. Fan, Array codes as low-density parity-check codes, in Proceedings of 2nd Interenational Symposium Turbo Codes, Brest, France, pp. 543\u2013546 (2000)"},{"key":"2273_CR39","unstructured":"H. Zhou, N. Goertz, Unavoidable cycles in polynomial-based time-invariant LDPC convolutional codes, in Proceedings of Wireless Conference on Sustainable Wireless Technology 2011, Vienna, Austria, pp. 1\u20136 (2011)"},{"issue":"7","key":"2273_CR40","doi-asserted-by":"publisher","first-page":"4553","DOI":"10.1109\/TIT.2013.2253512","volume":"59","author":"Y Wang","year":"2013","unstructured":"Y. Wang, S.C. Draper, J.S. Yedidia, Hierarchical and high-girth QC LDPC codes. IEEE Trans. Inf. Theory 59(7), 4553\u20134583 (2013). https:\/\/doi.org\/10.1109\/TIT.2013.2253512","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"2273_CR41","doi-asserted-by":"publisher","first-page":"1788","DOI":"10.1109\/TIT.2004.831841","volume":"50","author":"MPC Fossorier","year":"2004","unstructured":"M.P.C. Fossorier, 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":"4","key":"2273_CR42","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1109\/TIT.2021.3059414","volume":"67","author":"M Battaglioni","year":"2021","unstructured":"M. Battaglioni, F. Chiaraluce, M. Baldi, M. Lentmaier, Girth analysis and design of periodically time-varying SC-LDPC codes. IEEE Trans. Inf. Theory 67(4), 2217\u20132235 (2021). https:\/\/doi.org\/10.1109\/TIT.2021.3059414","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2273_CR43","doi-asserted-by":"publisher","unstructured":"G. Liva, M. Chiani, Protograph LDPC codes design based on EXIT analysis, in IEEE GLOBECOM 2007\u2014IEEE Global Telecommunications Conference, pp. 3250\u20133254 (2007). https:\/\/doi.org\/10.1109\/GLOCOM.2007.616","DOI":"10.1109\/GLOCOM.2007.616"},{"issue":"3","key":"2273_CR44","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1109\/TCOMM.2017.2774821","volume":"66","author":"M Battaglioni","year":"2018","unstructured":"M. Battaglioni, A. Tasdighi, G. Cancellieri, F. Chiaraluce, M. Baldi, Design and analysis of time-invariant SC-LDPC convolutional codes with small constraint length. IEEE Trans. Commun. 66(3), 918\u2013931 (2018)","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"2273_CR45","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"E.W. Dijkstra, A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"2273_CR46","doi-asserted-by":"crossref","unstructured":"S. Zhang, C. Schlegel, Causes and dynamics of LDPC error floors on AWGN channels, in Proceedings of 49th Annual Allerton Conference, Monticello, IL, pp. 1025\u20131032 (2011)","DOI":"10.1109\/Allerton.2011.6120280"},{"key":"2273_CR47","unstructured":"A. Beemer, C.A. Kelley, Avoiding trapping sets in SC-LDPC codes under windowed decoding, in Proceedings of ISITA 2016, Monterey, CA, pp. 206\u2013210 (2016)"},{"key":"#cr-split#-2273_CR48.1","doi-asserted-by":"crossref","unstructured":"L. Schmalen, D. Suikat, V. Aref, D. Roesener, On the design of capacity-approaching unit-memory spatially coupled LDPC codes for optical communications, in ECOC 2016","DOI":"10.1109\/SPAWC.2015.7227080"},{"key":"#cr-split#-2273_CR48.2","unstructured":"42nd European Conference on Optical Communication, pp. 1-3 (2016)"},{"key":"2273_CR49","doi-asserted-by":"publisher","unstructured":"K. Klaiber, S. Cammerer, L. Schmalen, S.t. Brink, Avoiding burst-like error patterns in windowed decoding of spatially coupled LDPC codes, in 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), pp. 1\u20135 (2018). https:\/\/doi.org\/10.1109\/ISTC.2018.8625312","DOI":"10.1109\/ISTC.2018.8625312"},{"issue":"9","key":"2273_CR50","doi-asserted-by":"publisher","first-page":"1822","DOI":"10.1109\/LCOMM.2013.070913.130966","volume":"17","author":"G Zhang","year":"2013","unstructured":"G. Zhang, R. Sun, X. Wang, Several explicit constructions for (3, L) QC-LDPC codes with girth at least eight. IEEE Commun. Lett. 17(9), 1822\u20131825 (2013). https:\/\/doi.org\/10.1109\/LCOMM.2013.070913.130966","journal-title":"IEEE Commun. Lett."},{"issue":"7","key":"2273_CR51","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1109\/LCOMM.2020.2983019","volume":"24","author":"M Majdzade","year":"2020","unstructured":"M. Majdzade, M. Gholami, On the class of high-rate QC-LDPC codes with girth 8 from sequences satisfied in GCD condition. IEEE Commun. Lett. 24(7), 1391\u20131394 (2020). https:\/\/doi.org\/10.1109\/LCOMM.2020.2983019","journal-title":"IEEE Commun. Lett."},{"issue":"9","key":"2273_CR52","doi-asserted-by":"publisher","first-page":"2820","DOI":"10.1109\/LCOMM.2021.3096386","volume":"25","author":"G Zhang","year":"2021","unstructured":"G. Zhang, Y. Hu, Y. Fang, D. Ren, Relation between GCD constraint and full-length row-multiplier QC-LDPC codes with girth eight. IEEE Commun. Lett. 25(9), 2820\u20132823 (2021). https:\/\/doi.org\/10.1109\/LCOMM.2021.3096386","journal-title":"IEEE Commun. Lett."},{"issue":"2","key":"2273_CR53","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1109\/TIT.2018.2865385","volume":"65","author":"Y Hashemi","year":"2019","unstructured":"Y. Hashemi, A.H. Banihashemi, Characterization and efficient search of non-elementary trapping sets of LDPC codes with applications to stopping sets. IEEE Trans. Inf. Theory 65(2), 1017\u20131033 (2019). https:\/\/doi.org\/10.1109\/TIT.2018.2865385","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-023-02273-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13638-023-02273-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-023-02273-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T07:02:51Z","timestamp":1690268571000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-023-02273-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,25]]},"references-count":54,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["2273"],"URL":"https:\/\/doi.org\/10.1186\/s13638-023-02273-0","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,25]]},"assertion":[{"value":"26 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2023","order":3,"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 that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"67"}}