{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T23:46:10Z","timestamp":1782344770509,"version":"3.54.5"},"reference-count":30,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"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":[[2025,12]]},"DOI":"10.1134\/s0032946025030019","type":"journal-article","created":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T15:37:14Z","timestamp":1766763434000},"page":"219-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["LDPC Codes from Deza Graphs"],"prefix":"10.1134","volume":"61","author":[{"given":"D.","family":"Crnkovi\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Rukavina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"\u0160imac","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"137","published-online":{"date-parts":[[2025,12,26]]},"reference":[{"key":"5122_CR1","doi-asserted-by":"publisher","unstructured":"Brouwer, A.E. and Haemers, W.H., Spectra of Graphs, New York: Springer, 2012. https:\/\/doi.org\/10.1007\/978-1-4614-1939-6","DOI":"10.1007\/978-1-4614-1939-6"},{"key":"5122_CR2","doi-asserted-by":"crossref","unstructured":"Ryan, W.E. and Lin, S., Channel Codes, Classical and Modern, Cambridge: Cambridge Univ. Press, 2009.","DOI":"10.1017\/CBO9780511803253"},{"key":"5122_CR3","doi-asserted-by":"crossref","unstructured":"Gallager, R.G., Low-Density Parity-Check Codes, Cambridge: MIT Press, 1963.","DOI":"10.7551\/mitpress\/4347.001.0001"},{"issue":"18","key":"5122_CR4","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1049\/el:19961141","volume":"32","author":"D.J.C. MacKay","year":"1996","unstructured":"MacKay, D.J.C. and Neal, R.M., Near Shannon Limit Performance of Low Density Parity Check Codes, Electron. Lett., 1996, vol.\u00a032, no.\u00a018, pp.\u00a01645\u20131646. https:\/\/doi.org\/10.1049\/el:19961141","journal-title":"Electron. Lett."},{"issue":"2","key":"5122_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"D.J.C. MacKay","year":"1999","unstructured":"MacKay, D.J.C., Good Error-Correcting Codes Based on Very Sparse Matrices, IEEE Trans. Inform. Theory, 1999, vol.\u00a045, no.\u00a02, pp.\u00a0399\u2013431. https:\/\/doi.org\/10.1109\/18.748992","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5122_CR6","unstructured":"Ivanov, F. and Zyablov, V., LDPC Codes Based on Steiner Quadruple Systems and Permutation Matrices, in Proc. 14th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT-14), Svetlogorsk, Russia, Sept. 7\u201313, 2014, pp.\u00a0175\u2013180."},{"key":"5122_CR7","doi-asserted-by":"publisher","unstructured":"Johnson, S.J. and Weller, S.R., High-Rate LDPC Codes from Unital Designs, in Proc. IEEE 2003 Global Telecommunications Conf. (GLOBECOM'03), San Francisco, CA, USA, Dec. 1\u20135, 2003, vol.\u00a04, pp.\u00a02036\u20132040. https:\/\/doi.org\/10.1109\/GLOCOM.2003.1258594","DOI":"10.1109\/GLOCOM.2003.1258594"},{"key":"5122_CR8","doi-asserted-by":"publisher","unstructured":"Johnson, S.J. and Weller, S.R., Construction of Low-Density Parity-Check Codes from Kirkman Triple Systems, Proc. IEEE 2001 Global Telecommunications Conf. (GLOBECOM'01), San Antonio, TX, USA, Nov. 25\u201329, 2001, vol.\u00a02, pp.\u00a0970\u2013974. https:\/\/doi.org\/10.1109\/GLOCOM.2001.965562","DOI":"10.1109\/GLOCOM.2001.965562"},{"issue":"2","key":"5122_CR9","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s00373-019-02007-4","volume":"35","author":"D. Crnkovi\u0107","year":"2019","unstructured":"Crnkovi\u0107, D., Rukavina, S., and \u0160imac, M., LDPC Codes from $\\mu$-Geodetic Graphs Obtained from Block Designs, Graphs Combin., 2019, vol.\u00a035, no.\u00a02, pp.\u00a0451\u2013469. https:\/\/doi.org\/10.1007\/s00373-019-02007-4","journal-title":"Graphs Combin."},{"issue":"5","key":"5122_CR10","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s00200-020-00468-2","volume":"33","author":"D. Crnkovi\u0107","year":"2022","unstructured":"Crnkovi\u0107, D., Rukavina, S., and \u0160imac, M., LDPC Codes Constructed from Cubic Symmetric Graphs, Appl. Algebra Eng. Commun. Comput., 2022, vol.\u00a033, no.\u00a05, pp.\u00a0505\u2013522. https:\/\/doi.org\/10.1007\/s00200-020-00468-2","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"2","key":"5122_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.26493\/1855-3974.2501.4c4","volume":"22","author":"D. Crnkovi\u0107","year":"2022","unstructured":"Crnkovi\u0107, D., Rukavina, S., and \u0160imac, M., LDPC Codes from Cubic Semisymmetric Graphs, Ars Math. Contemp., 2022, vol.\u00a022, no.\u00a02, p.\u00a03 (13 pp). https:\/\/doi.org\/10.26493\/1855-3974.2501.4c4","journal-title":"Ars Math. Contemp."},{"key":"5122_CR12","doi-asserted-by":"publisher","unstructured":"Li, J.-L., Chen, W., Jiang, X.-Q., Zhang, X.-D., and Wang H.-M., Construction of Multiple-Rate Quasi-Cyclic LDPC Codes with Girth Eight, in Proc. 8th Int. Conf. on Wireless Communications & Signal Processing (WCSP'2016), Yangzhou, China, Oct. 13\u201315, 2016, pp.\u00a01\u20135. https:\/\/doi.org\/10.1109\/WCSP.2016.7752486","DOI":"10.1109\/WCSP.2016.7752486"},{"issue":"6","key":"5122_CR13","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","volume":"48","author":"C. Di","year":"2002","unstructured":"Di, C., Proietti, D., Telatar, I.E., Richardson, T.J., and Urbanke, R.L., Finite-Length Analysis of Low-Density Parity-Check Codes on the Binary Erasure Channel, IEEE Trans. Inform. Theory, 2002, vol.\u00a048, no.\u00a06, pp.\u00a01570\u20131579. https:\/\/doi.org\/10.1109\/TIT.2002.1003839","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"5122_CR14","doi-asserted-by":"publisher","first-page":"3248","DOI":"10.1109\/TIT.2010.2048448","volume":"56","author":"C. Schlegel","year":"2010","unstructured":"Schlegel, C. and Zhang, S., On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes, IEEE Trans. Inform. Theory, 2010, vol.\u00a056, no.\u00a07, pp.\u00a03248\u20133264. https:\/\/doi.org\/10.1109\/TIT.2010.2048448","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5122_CR15","doi-asserted-by":"publisher","unstructured":"Diao, Q., Tai, Y.Y., Lin, S., and Abdel-Ghaffar, K., Trapping Set Structure of LDPC Codes on Finite Geometries, in Proc. 2013 Information Theory and Applications Workshop (ITA'2013), San Diego, CA, Feb. 10\u201315, 2013, pp.\u00a01\u20138. https:\/\/doi.org\/10.1109\/ITA.2013.6502922","DOI":"10.1109\/ITA.2013.6502922"},{"issue":"6","key":"5122_CR16","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1002\/(SICI)1520-6610(1999)7:6<395::AID-JCD1>3.0.CO;2-U","volume":"7","author":"M. Erickson","year":"1999","unstructured":"Erickson, M., Fernando, S., Haemers, W.H., Hardy, D., and Hemmeter, J., Deza Graphs: A Generalization of Strongly Regular Graphs, J. Combin. Des., 1999, vol.\u00a07, no.\u00a06, pp.\u00a0395\u2013405. https:\/\/doi.org\/10.1002\/(SICI)1520-6610(1999)7:6<395::AID-JCD1>3.0.CO;2-U","journal-title":"J. Combin. Des."},{"key":"5122_CR17","unstructured":"Greferath, M., R\u00f6\u00dfing, C., and Storme, L., Galois Geometries and Low-Density Parity-Check Codes, Current Research Topics in Galois Geometry, Storme, L. and de Beule, J., Eds., New York: Nova Science, 2012, pp.\u00a0245\u2013275."},{"key":"5122_CR18","unstructured":"Grassl, M., Bounds on the Minimum Distance of Linear Codes and Quantum Codes (electronic tables). Available online at http:\/\/www.codetables.de."},{"issue":"1","key":"5122_CR19","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1025136524481","volume":"18","author":"P.R. Hafner","year":"2003","unstructured":"Hafner, P.R., The Hoffman\u2013Singleton Graph and Its Automorphisms, J. Algebraic Combin., 2003, vol.\u00a018, no.\u00a01, pp.\u00a07\u201312. https:\/\/doi.org\/10.1023\/A:1025136524481","journal-title":"J. Algebraic Combin."},{"key":"5122_CR20","unstructured":"Handbook of Magma Functions, Bosma, W., Cannon, J.J., Fieker, C., and Steel, A., Eds., Computational Algebra Group, School of Mathematics and Statistics, Univ. of Sydney, 2010\u20132025. Available at http:\/\/magma.maths.usyd.edu.au\/magma\/handbook\/"},{"key":"5122_CR21","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0012-365X(92)90563-U","volume":"106\u2013107","author":"J.L. Massey","year":"1992","unstructured":"Massey, J.L., Linear Codes with Complementary Duals, Discrete Math., 1992, vol.\u00a0106\u2013107, pp.\u00a0337\u2013342. https:\/\/doi.org\/10.1016\/0012-365X(92)90563-U","journal-title":"Discrete Math."},{"key":"5122_CR22","doi-asserted-by":"publisher","unstructured":"Carlet, C. and Guilley, S., Complementary Dual Codes for Counter-Measures to Side-Channel Attacks, Coding Theory and Applications: 4th Int. Castle Meeting (ICMCTA 2014), Palmela Castle, Portugal, Sept. 15\u201318, 2014, Pinto, R., Rocha Malonek, P., and Vettori, P., Eds., CIM Ser. Math. Sci., vol.\u00a03, Cham: Springer, 2015, pp.\u00a097\u2013105. https:\/\/doi.org\/10.1007\/978-3-319-17296-5_9","DOI":"10.1007\/978-3-319-17296-5_9"},{"issue":"4","key":"5122_CR23","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s12095-018-0319-0","volume":"11","author":"M. Harada","year":"2019","unstructured":"Harada, M. and Saito, K., Binary Linear Complementary Dual Codes, Cryptogr. Commun., 2019, vol.\u00a011, no.\u00a04, pp.\u00a0677\u2013696. 677-696 (2019). https:\/\/doi.org\/10.1007\/s12095-018-0319-0","journal-title":"Cryptogr. Commun."},{"issue":"3","key":"5122_CR24","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00200-017-0339-6","volume":"29","author":"J.D. Key","year":"2018","unstructured":"Key, J.D. and Rodrigues, B.G., LCD Codes from Adjacency Matrices of Graphs, Appl. Algebra Eng. Commun. Comput., 2018, vol.\u00a029, no.\u00a03, pp.\u00a0227\u2013244. https:\/\/doi.org\/10.1007\/s00200-017-0339-6","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"5122_CR25","unstructured":"Thorpe, J., Low Density Parity Check (LDPC) Codes Constructed from Protographs, Interplanetary Network Progress Report of the Jet Propulsion Lab., California Inst. of Technology, 2003, no.\u00a042-154. Available at https:\/\/ipnpr.jpl.nasa.gov\/progress_report\/42-154\/154C.pdf."},{"issue":"11","key":"5122_CR26","doi-asserted-by":"publisher","first-page":"2148","DOI":"10.1109\/LCOMM.2013.091113.131646","volume":"17","author":"G. Lechner","year":"2013","unstructured":"Lechner, G. and Pacher, C., Estimating Channel Parameters from the Syndrome of a Linear Code, IEEE Commun. Lett., 2013, vol.\u00a017, no.\u00a011, pp.\u00a02148\u20132151. https:\/\/doi.org\/10.1109\/LCOMM.2013.091113.131646","journal-title":"IEEE Commun. Lett."},{"issue":"2","key":"5122_CR27","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/LCOMM.2011.122810.102182","volume":"15","author":"V. Toto-Zarasoa","year":"2011","unstructured":"Toto-Zarasoa, V., Roumy, A., and Guillemot, C., Maximum Likelihood BSC Parameter Estimation for the Slepian-Wolf Problem, IEEE Commun. Lett., 2011, vol.\u00a015, no.\u00a02, pp.\u00a0232\u2013234. https:\/\/doi.org\/10.1109\/LCOMM.2011.122810.102182","journal-title":"IEEE Commun. Lett."},{"key":"5122_CR28","doi-asserted-by":"publisher","unstructured":"Pacher, C., Grabenweger, P., and Simos, D.E., Weight Distribution of the Syndrome of Linear Codes and Connections to Combinatorial Designs, in Proc. 2016 IEEE Int. Symp. on Information Theory (ISIT'2016), Barcelona, Spain, July 10\u201315, 2016, pp.\u00a03038\u20133042. https:\/\/doi.org\/10.1109\/ISIT.2016.7541857","DOI":"10.1109\/ISIT.2016.7541857"},{"key":"5122_CR29","unstructured":"Neal, R.M., Software for Low Density Parity Check (LDPC) codes, Release of 2012-02-11. Avaibale at https:\/\/glizen.com\/radfordneal\/ldpc.software.html."},{"key":"5122_CR30","doi-asserted-by":"publisher","first-page":"141161","DOI":"10.1109\/ACCESS.2019.2942999","volume":"7","author":"A. Elkelesh","year":"2019","unstructured":"Elkelesh, A., Ebada, M., Cammerer, S., Schmalen, L., and ten Brink, S., Decoder-in-the-Loop: Genetic Optimization-Based LDPC Code Design, IEEE Access, 2019, vol.\u00a07,p. 141161\u2013141170. https:\/\/doi.org\/10.1109\/ACCESS.2019.2942999","journal-title":"IEEE Access"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946025030019.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946025030019","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946025030019.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:54:18Z","timestamp":1775012058000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946025030019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["5122"],"URL":"https:\/\/doi.org\/10.1134\/s0032946025030019","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"2 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors of this work declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}