{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:21:58Z","timestamp":1773616918061,"version":"3.50.1"},"reference-count":16,"publisher":"Pleiades Publishing Ltd","issue":"10","license":[{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"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":["Autom Remote Control"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1134\/s0005117916100052","type":"journal-article","created":{"date-parts":[[2016,10,17]],"date-time":"2016-10-17T09:33:10Z","timestamp":1476696790000},"page":"1781-1791","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Vectorizing computations at decoding of nonbinary codes with small density of checks"],"prefix":"10.1134","volume":"77","author":[{"given":"I. V.","family":"Zhilin","sequence":"first","affiliation":[]},{"given":"F. I.","family":"Ivanov","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2016,10,18]]},"reference":[{"key":"520_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low Density Parity Check Codes","author":"R.G. Gallager","year":"1963","unstructured":"Gallager, R.G., Low Density Parity Check Codes, Cambridge: MIT Press, 1963. Translated under the title Kody s maloi plotnost\u2019yu proverok, Moscow: Mir, 1966."},{"issue":"5","key":"520_CR2","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"M.A. Tanner","year":"1981","unstructured":"Tanner, M.A., Recursive Approach to Low Complexity Codes, IEEE Trans. Inform. Theory, 1981, vol. 27, no. 5, pp. 533\u2013547.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"520_CR3","first-page":"23","volume":"11","author":"V.V. Zyablov","year":"1975","unstructured":"Zyablov, V.V. and Pinsker, M.S., Estimating Complexity of Error Correction by the Low-Density Gallager Codes, Probl. Peredachi Inf., 1975, vol. 11, no. 1, pp. 23\u201336.","journal-title":"Probl. Peredachi Inf."},{"issue":"2","key":"520_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"M. Davey","year":"1999","unstructured":"Davey, M. and MacKay, D.J.C., Good Error-Correcting Codes Based on Very Sparse Matrices, IEEE Trans. Inform. Theory, 1999, vol. 45, no. 2, pp. 399\u2013432.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"520_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1109\/4234.681360","volume":"2","author":"M. Davey","year":"1998","unstructured":"Davey, M. and MacKay, D.J.C., Low Density Parity Check Codes Over GF(q), IEEE Commun. Lett., 1998, vol. 2, no. 6, pp. 165\u2013167.","journal-title":"IEEE Commun. Lett."},{"issue":"3","key":"520_CR6","first-page":"50","volume":"44","author":"K.Sh. Zigangirov","year":"2008","unstructured":"Zigangirov, K.Sh., Pusane, A.E., Zigangirov, D.K., and Kostello, D.Dzh., On Correctability of Codes with Lew Density of Parity Checks, Probl. Peredachi Inf., 2008, vol. 44, no. 3, pp. 50\u201362.","journal-title":"Probl. Peredachi Inf."},{"issue":"3","key":"520_CR7","first-page":"15","volume":"45","author":"P.S. Rybin","year":"2009","unstructured":"Rybin, P.S. and Zyablov, V.V., Correction of Deletions by Low Density Parity-Check Codes, Probl. Peredachi Inf., 2009, vol. 45, no. 3, pp. 15\u201332.","journal-title":"Probl. Peredachi Inf."},{"issue":"4","key":"520_CR8","first-page":"3","volume":"48","author":"V.V. Zyablov","year":"2012","unstructured":"Zyablov, V.V. and Rybin, P.S., Analysis of Relations Between the Properties of the LDPC codes and the Tanner Graph, Probl. Peredachi Inf., 2012, vol. 48, no. 4, pp. 3\u201329.","journal-title":"Probl. Peredachi Inf."},{"issue":"1","key":"520_CR9","first-page":"39","volume":"41","author":"A. Shridkharan","year":"2005","unstructured":"Shridkharan, A., Lentmaier, M., Trukhachev, D.V., et al., On Minimal Distance of Low-density Codes with Checking Matrices of the Permutation Matrices, Probl. Peredachi Inf., 2005, vol. 41, no. 1, pp. 39\u201352.","journal-title":"Probl. Peredachi Inf."},{"issue":"2","key":"520_CR10","first-page":"47","volume":"46","author":"A.A. Frolov","year":"2010","unstructured":"Frolov, A.A. and Zyablov V.V., Asymptotic Estimate of the Part of Errors Correctable by the q-ary LDPC codes, Probl. Peredachi Inf., 2010, vol. 46, no. 2, pp. 47\u201365.","journal-title":"Probl. Peredachi Inf."},{"issue":"4","key":"520_CR11","first-page":"27","volume":"47","author":"A.A. Frolov","year":"2011","unstructured":"Frolov, A.A. and Zyablov, V.V., Boundaries of the Minimal Code Distance for the Nonbinary Codes on Bipartite Graphs, Probl. Peredachi Inf., 2011, vol. 47, no. 4, pp. 27\u201342.","journal-title":"Probl. Peredachi Inf."},{"issue":"4","key":"520_CR12","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1109\/TCOMM.2007.894088","volume":"55","author":"D. Declercq","year":"2007","unstructured":"Declercq, D. and Fossorier, M., Decoding Algorithms for Nonbinary LDPC Codes over GF(q), IEEE Trans. Commun., 2007, vol. 55, no. 4, pp. 633\u2013643.","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"520_CR13","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1109\/TCOMM.2008.060024","volume":"56","author":"S. Lin","year":"2008","unstructured":"Lin, S., Song, S., Lan, L., Zeng, L., and Tai, Y.Y., Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach, IEEE Trans. Commun., 2008, vol. 56, no. 4, pp. 545\u2013554.","journal-title":"IEEE Trans. Commun."},{"key":"520_CR14","volume-title":"Proc. 9 Int. Sympos. Commun. Theory Appl. (ISCTA)","author":"S. Lin","year":"2007","unstructured":"Lin, S., Song, S., and Zhou, B., Algebraic Constructions of Non-Binary Quasi-Cyclic LDPC Codes: Array Masking and Dispersion, Proc. 9 Int. Sympos. Commun. Theory Appl. (ISCTA), Ambleside, Lake District, 2007."},{"key":"520_CR15","volume-title":"Non-binary Error Control Coding for Wireless Communication and Data Storage","author":"R.A. Carrasco","year":"2009","unstructured":"Carrasco, R.A. and Johnston, M., Non-binary Error Control Coding for Wireless Communication and Data Storage, New York: Wiley, 2009."},{"key":"520_CR16","first-page":"49","volume":"6","author":"F.I. Ivanov","year":"2012","unstructured":"Ivanov, F.I., Zhilin, I.V., and Zyablov, V.V., An Algorithm to Decode the Low-density Codes with High Parallellization, Informats.-Upravl. Sist., 2012, no. 6, pp. 49\u201355.","journal-title":"Informats.-Upravl. Sist."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117916100052.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117916100052","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117916100052.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:29:14Z","timestamp":1773613754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117916100052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":16,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["520"],"URL":"https:\/\/doi.org\/10.1134\/s0005117916100052","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10]]},"assertion":[{"value":"14 July 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2016","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}