{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:40:43Z","timestamp":1775054443483,"version":"3.50.1"},"reference-count":12,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"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,4]]},"DOI":"10.1134\/s0032946020020039","type":"journal-article","created":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T04:02:53Z","timestamp":1594699373000},"page":"173-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Detecting Cycles of Length 8 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":[[2020,7,14]]},"reference":[{"key":"4376_CR1","unstructured":"Tanner, R.M., On Quasi-cyclic Repeat-Accumulate Codes, in Proc. 37th Allerton Conf. on Communication, Control and Computing, Monticello, IL, USA, Sept. 22\u201324, 1999, pp. 249\u2013259."},{"issue":"8","key":"4376_CR2","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. Inform. Theory, 2004, vol. 50, no. 8, pp. 1788\u20131793.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4376_CR3","unstructured":"Fan, J.L., Array Codes as Low-Density Parity-Check Codes, in Proc. 2nd Int. Symp. on Turbo Codes and Related Topics, Brest, France, Sept. 4\u20137, 2000, pp. 543\u2013546."},{"issue":"2","key":"4376_CR4","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1109\/18.910578","volume":"47","author":"TJ Richardson","year":"2001","unstructured":"Richardson, T.J., Shokrollahi, M.A., and Urbanke, R.L., Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes, IEEE Trans. Inform. Theory, 2001, vol. 47, no. 2, pp. 619\u2013637.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"4376_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1109\/TCOMM.2003.822172","volume":"54","author":"Z Li","year":"2006","unstructured":"Li, Z., Chen, L., Zeng, L., Lin, S., and Fong, W.H., Efficient Encoding of Quasi-cyclic Low-Density Parity-Check Codes, IEEE Trans. Commun., 2006, vol. 54, no. 1, pp. 71\u201381.","journal-title":"IEEE Trans. Commun."},{"issue":"2","key":"4376_CR6","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"FR Kschischang","year":"2001","unstructured":"Kschischang, F.R., Frey, B.J., and Loeliger, H.-A., Factor Graphs and the Sum-Product Algorithm, IEEE Trans. Inform. Theory, 2001, vol. 47, no. 2, pp. 498\u2013519.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"4376_CR7","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. 52, no. 8, pp. 1242\u20131247.","journal-title":"IEEE Trans. Commun."},{"key":"4376_CR8","doi-asserted-by":"crossref","unstructured":"Mao, Y. and Banihashemi, A.H., A Heuristic Search for Good Low-Density Parity-Check Codes at Short Block Lengths, in Proc. 2001 IEEE Int. Conf. on Communications (ICC\u20192001), Helsinki, Finland, June 11\u201314, 2001, vol. 1, pp. 41\u201344.","DOI":"10.1109\/ICC.2001.936269"},{"issue":"7","key":"4376_CR9","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. 59, no. 7, pp. 4542\u20134552.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4376_CR10","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. 5\u20139, 2016, pp. 146\u2013150.","DOI":"10.1109\/ISTC.2016.7593094"},{"issue":"1","key":"4376_CR11","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1109\/TIT.2004.839541","volume":"51","author":"X-Y Hu","year":"2003","unstructured":"Hu, X.-Y., Eleftheriou, E., and Arnold, D.M., Regular and Irregular Progressive Edge-Growth Tanner Graphs, IEEE Trans. Inform. Theory, 2003, vol. 51, no. 1, pp. 386\u2013398.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4376_CR12","first-page":"26","volume":"4","author":"AA Ovinnikov","year":"2016","unstructured":"Ovinnikov, A.A., Images of Cycles of Cyclic Liftings in the Base Graph of Protograph LDPC Codes, Tsifrovaya Obrabotka Signalov, 2016, no. 4, pp. 26\u201330.","journal-title":"Tsifrovaya Obrabotka Signalov"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946020020039.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946020020039","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946020020039.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:41:57Z","timestamp":1775011317000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946020020039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["4376"],"URL":"https:\/\/doi.org\/10.1134\/s0032946020020039","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4]]},"assertion":[{"value":"5 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}