{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:28:25Z","timestamp":1775017705552,"version":"3.50.1"},"reference-count":10,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"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":["Probl Inf Transm"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1134\/s0032946020040031","type":"journal-article","created":{"date-parts":[[2021,1,27]],"date-time":"2021-01-27T09:02:58Z","timestamp":1611738178000},"page":"317-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis"],"prefix":"10.1134","volume":"56","author":[{"given":"A. V.","family":"Kharin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. N.","family":"Zavertkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. A.","family":"Ovinnikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2021,1,27]]},"reference":[{"key":"5007_CR1","doi-asserted-by":"crossref","unstructured":"Kharin, A.V., Zavertkin, K.N., and Ovinnikov, A.A., Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis, Probl. Peredachi Inf., 2020, vol.\u00a056, no.\u00a02, pp.\u00a082\u201394 [Probl. Inf. Transm. (Engl. Transl.), 2020, vol.\u00a056, no.\u00a02, pp.\u00a0173\u2013184].","DOI":"10.1134\/S0032946020020039"},{"key":"5007_CR2","unstructured":"Richardson, T. and Urbanke, R., Multi-Edge Type LDPC Codes, Tech. Report of Communication Theories Lab. (LTHC), EPFL, Switzerland, 2004, no.\u00a0LTHC-REPORT-2004-001. Available at http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.106.7310."},{"key":"5007_CR3","unstructured":"Thorpe, J., Low Density Parity Check (LDPC) Codes Constructed from Protographs, The Interplanetary Network Progress Report of Jet Propulsion Lab., California Inst. of Technology, 2003, no.\u00a042-154. Available at https:\/\/ipnpr.jpl.nasa.gov\/progress_report\/42-154\/154C.pdf."},{"key":"5007_CR4","unstructured":"Fan, J.L., Array Codes as Low-Density check Codes, in Proc. 2nd Int. Symp. on Turbo Codes and Related Topics, Brest, France, Sept.\u00a04\u20137, 2000, pp.\u00a0543\u2013546."},{"issue":"no. 1","key":"5007_CR5","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1109\/TIT.2004.839541","volume":"51","author":"X-Y Hu","year":"2005","unstructured":"Hu, X.-Y., Eleftheriou, E., and Arnold, D.M., Regular and Irregular Progressive Edge-Growth Tanner Graphs, IEEE Trans. Inform. Theory, 2005, vol.\u00a051, no.\u00a01, pp.\u00a0386\u2013398.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"no. 8","key":"5007_CR6","doi-asserted-by":"publisher","first-page":"1242","DOI":"10.1109\/TCOMM.2004.833048","volume":"52","author":"T Tian","year":"2004","unstructured":"Tian, T., Jones, C.R., Villasenor, J.D., and Wesel, R.D., Selective Avoidance of Cycles in Irregular LDPC Code Construction, IEEE Trans. Commun., 2004, vol.\u00a052, no.\u00a08, pp.\u00a01242\u20131247.","journal-title":"IEEE Trans. Commun."},{"issue":"no. 8","key":"5007_CR7","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 check Codes from Circulant Permutation Matrices, IEEE Trans. Inform. Theory, 2004, vol.\u00a050, no.\u00a08, pp.\u00a01788\u20131793.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5007_CR8","doi-asserted-by":"crossref","unstructured":"Xiao, G. and Nan, Z., Analysis of Balanced Cycles of QC-LDPC Codes, in Proc. 8th Int. Conf. on Wireless and Optical Communication Networks (WOCN\u20192011), Paris, France, May\u00a024\u201326, 2011, pp.\u00a01\u20135.","DOI":"10.1109\/WOCN.2011.5872931"},{"key":"5007_CR9","doi-asserted-by":"crossref","unstructured":"Diouf, M., Declercq, D., Fossorier, M., Quya, S., and Vasi\u0107, B., Improved PEG Construction of Large Girth QC-LDPC Codes, in Proc. 9th Int. Symp. on Turbo Codes & Iterative Information Processing (ISTC\u20192016), Brest, France, Sept.\u00a05\u20139, 2016, pp.\u00a0146\u2013150.","DOI":"10.1109\/ISTC.2016.7593094"},{"issue":"no. 7","key":"5007_CR10","doi-asserted-by":"publisher","first-page":"4542","DOI":"10.1109\/TIT.2013.2251395","volume":"59","author":"M Karimi","year":"2013","unstructured":"Karimi, M. and Banihashemi, A.H., On the Girth of Quasi Cyclic Protograph LDPC Codes, IEEE Trans. Inform. Theory, 2013, vol.\u00a059, no.\u00a07, pp.\u00a04542\u20134552.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946020040031.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946020040031","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946020040031.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:47:43Z","timestamp":1775011663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946020040031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["5007"],"URL":"https:\/\/doi.org\/10.1134\/s0032946020040031","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]},"assertion":[{"value":"27 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}