{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:45:55Z","timestamp":1775054755845,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T00:00:00Z","timestamp":1602547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T00:00:00Z","timestamp":1602547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s00200-020-00468-2","type":"journal-article","created":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T18:03:08Z","timestamp":1602612188000},"page":"505-522","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["LDPC codes constructed from cubic symmetric graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Dean","family":"Crnkovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanja","family":"Rukavina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"\u0160imac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,13]]},"reference":[{"key":"468_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-4529-6","volume-title":"A Textbook of Graph Theory","author":"R Balakrishnan","year":"2012","unstructured":"Balakrishnan, R., Ranganathan, K.: A Textbook of Graph Theory. Springer, New York (2012)"},{"key":"468_CR2","series-title":"CIM Series in Mathematical Sciences","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-17296-5_9","volume-title":"Coding Theory and Applications","author":"C Carlet","year":"2015","unstructured":"Carlet, C., Guilley, S.: Complementary dual codes for counter-measures to side-channel attacks. In: Pinto, R., Rocha Malonek, P., Vettori, P. (eds.) Coding Theory and Applications. CIM Series in Mathematical Sciences, vol. 3, pp. 97\u2013105. Springer, Cham (2015)"},{"key":"468_CR3","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0095-8956(79)90066-2","volume":"27","author":"PA Catlin","year":"1979","unstructured":"Catlin, P.A.: Brooks\u2019 graph-coloring theorem and the independence number. J. Comb. Theory 27, 42\u201348 (1979)","journal-title":"J. Comb. Theory"},{"key":"468_CR4","doi-asserted-by":"crossref","unstructured":"Chilappagari, S. K., Nguyen, D. V., Vasi\u0107, B. V., Marcellin, M. W.: Girth of the Tanner graph and error correction capability of LDPC codes. In: 46th Annual Allerton Conference on Communication, Control and Computing, pp. 1238\u20131245 (2008)","DOI":"10.1109\/ALLERTON.2008.4797702"},{"key":"468_CR5","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1016\/j.jalgebra.2009.03.011","volume":"322","author":"M Conder","year":"2009","unstructured":"Conder, M., Nedela, R.: A refined classification of symmetric cubic graphs. J. Algebra 322, 722\u2013740 (2009)","journal-title":"J. Algebra"},{"key":"468_CR6","unstructured":"Conder, M.: Trivalent (cubic) symmetric graphs on up to 2048 vertices, https:\/\/www.math.auckland.ac.nz\/~conder\/symmcubic2048list.txt, Accessed on 20\/09\/2020"},{"key":"468_CR7","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., \u0160imac, M.: LDPC codes from $$\\mu $$-geodetic graphs obtained from block designs. Graphs Combin. 35, 451\u2013469 (2019)","journal-title":"Graphs Combin."},{"key":"468_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph theory. Springer-Verlag, Berlin Heidelberg (2017)"},{"key":"468_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1109\/T-AIEE.1932.5056068","volume":"51","author":"RM Foster","year":"1932","unstructured":"Foster, R.M.: Geometrical circuits of electrical networks. Trans. Am. Inst. Electr. Eng. 51, 309\u2013317 (1932)","journal-title":"Trans. Am. Inst. Electr. Eng."},{"key":"468_CR10","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"RG Gallager","year":"1963","unstructured":"Gallager, R.G.: Low-Density Parity-Check Codes. MIT Press, Cambridge, MA (1963)"},{"key":"468_CR11","first-page":"245","volume-title":"Current Research Topics in Galois Geometry","author":"M Greferath","year":"2012","unstructured":"Greferath, M., Ro\u00dfing, C., Storme, L.: Galois geometries and low-density parity-check codes. In: Storme, L., De Boeule, J. (eds.) Current Research Topics in Galois Geometry, pp. 245\u2013275. Nova Science Publishers, New York (2012)"},{"key":"468_CR12","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1109\/LCOMM.2017.2707553","volume":"21","author":"Y Hashemi","year":"2017","unstructured":"Hashemi, Y., Banihashemi, A.H.: Lower bounds on the size of smallest elementary and non-elementary trapping sets in variable-regular LDPC codes. IEEE Commun. Lett. 21, 1905\u20131908 (2017)","journal-title":"IEEE Commun. Lett."},{"key":"468_CR13","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s12095-018-0319-0","volume":"11","author":"M Harada","year":"2019","unstructured":"Harada, M., Saito, K.: Binary linear complementary dual codes. Cryptogr. Commun. 11, 677\u2013696 (2019)","journal-title":"Cryptogr. Commun."},{"key":"468_CR14","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.jctb.2008.06.001","volume":"99","author":"K Kutnar","year":"2009","unstructured":"Kutnar, K., Maru\u0161i\u010d, D.: A complete classification of cubic symmetric graphs of girth 6. J. Combin. Theory Ser. B 99, 162\u2013184 (2009)","journal-title":"J. Combin. Theory Ser. B"},{"key":"468_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"468_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00200-017-0339-6","volume":"29","author":"JD Key","year":"2018","unstructured":"Key, J.D., Rodrigues, B.G.: LCD codes from adjacency matrices of graphs. Appl. Algebr. Eng. Comm. 29, 227\u2013244 (2018)","journal-title":"Appl. Algebr. Eng. Comm."},{"key":"468_CR17","doi-asserted-by":"publisher","first-page":"2378","DOI":"10.1109\/TIT.2004.834760","volume":"50","author":"J-L Kim","year":"2004","unstructured":"Kim, J.-L., Peled, U.N., Perepelitsa, I., Pless, V.: Explicit construction of families of LDPC codes with no 4-cycles. IEEE Trans. Inform. Theory 50, 2378\u20132388 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"468_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0166-218X(94)00058-L","volume":"60","author":"F Lazebnik","year":"1995","unstructured":"Lazebnik, F., Ustimenko, V.A.: Explicit construction of graphs with arbitrary large girth and of large size. Discrete Appl. Math. 60, 275\u2013284 (1995)","journal-title":"Discrete Appl. Math."},{"key":"468_CR19","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1049\/el:19970362","volume":"32","author":"DJC MacKay","year":"1997","unstructured":"MacKay, D.J.C., Neal, R.M.: Near shannon limit performance of low density parity check codes. Electron. Lett. 32, 457\u2013458 (1997)","journal-title":"Electron. Lett."},{"key":"468_CR20","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"DJC MacKay","year":"1999","unstructured":"MacKay, D.J.C., Neal, R.M.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory 45, 399\u2013431 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"107","key":"468_CR21","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0012-365X(92)90563-U","volume":"106","author":"JL Massey","year":"1992","unstructured":"Massey, J.L.: Linear codes with complementary duals. Discrete Math. 106(107), 337\u2013342 (1992)","journal-title":"Discrete Math."},{"key":"468_CR22","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(91)90112-F","volume":"91","author":"A Nilli","year":"1991","unstructured":"Nilli, A.: On the second eigenvalue of a graph. Discrete Math. 91, 207\u2013210 (1991)","journal-title":"Discrete Math."},{"key":"468_CR23","doi-asserted-by":"publisher","first-page":"2148","DOI":"10.1109\/LCOMM.2013.091113.131646","volume":"17","author":"G Lechner","year":"2013","unstructured":"Lechner, G., Pacher, C.: Estimating channel parameters from the syndrome of a linear code. IEEE Commun. Lett. 17, 2148\u20132151 (2013)","journal-title":"IEEE Commun. Lett."},{"key":"468_CR24","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10801-011-0340-2","volume":"36","author":"P Poto\u010dnik","year":"2012","unstructured":"Poto\u010dnik, P., Spiga, P., Verret, G.: On the nullspace of arc-transitive graphs over finite fields. J. Algebr. Comb. 36, 389\u2013401 (2012)","journal-title":"J. Algebr. Comb."},{"key":"468_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253","volume-title":"Channel Codes: Classical and Modern","author":"WE Ryan","year":"2009","unstructured":"Ryan, W.E., Lin, S.: Channel Codes: Classical and Modern. Cambridge University Press, Cambridge (2009)"},{"key":"468_CR26","doi-asserted-by":"crossref","unstructured":"Pacher, C., Grabenweger, P., Simos, D.E., Simos, D.E.: Weight distribution of the syndrome of linear codes and connections to combinatorial designs. In: IEEE International Symposium on Information Theory (ISIT), pp. 3038\u20133042 (2016)","DOI":"10.1109\/ISIT.2016.7541857"},{"key":"468_CR27","unstructured":"Neal, R.M.: Software for Low Density Parity Check (LDPC) codes, Release of 2012-02-11. http:\/\/www.cs.utoronto.ca\/~radford\/"},{"key":"468_CR28","unstructured":"Rosenthal, J., Vontobel, P.O.: Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis. In: 38th Allerton Conference on Communication, Control and Computing, pp. 248\u2013257 (2000)"},{"key":"468_CR29","first-page":"2428","volume":"5","author":"T Shibuya","year":"2003","unstructured":"Shibuya, T., Onikubo, M., Sakaniwa, K.: On Tanner\u2019s lower bound for the minimum distance of regular LDPC codes based on combinatorial designs. IEICE Trans. Fundam. 5, 2428\u20132434 (2003)","journal-title":"IEICE Trans. Fundam."},{"key":"468_CR30","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10623-019-00667-0","volume":"88","author":"J Singh","year":"2020","unstructured":"Singh, J., Gupta, M., Bhullar, J.S.: Construction of girth-8 $$(3, L)$$-QC-LDPC codes of smallest CPM size using column multipliers. Des. Codes Cryptogr. 88, 41\u201349 (2020)","journal-title":"Des. Codes Cryptogr."},{"key":"468_CR31","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1109\/18.910591","volume":"47","author":"RM Tanner","year":"2001","unstructured":"Tanner, R.M.: Minimum-distance bounds by graph analysis. IEEE Trans. Inform. Theory 47, 808\u2013821 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"468_CR32","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., Guillemot, C.: Maximum Likelihood BSC Parameter Estimation for the Slepian-Wolf Problem. IEEE Commun. Lett. 15, 232\u2013234 (2011)","journal-title":"IEEE Commun. Lett."},{"key":"468_CR33","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ffa.2017.03.004","volume":"46","author":"H Xu","year":"2017","unstructured":"Xu, H., Bai, B., Feng, D., Sun, C.: On the girth of Tanner (3,11) quasi-cyclic LDPC codes. Finite Fields Appl. 46, 65\u201389 (2017)","journal-title":"Finite Fields Appl."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00468-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-020-00468-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00468-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T14:05:18Z","timestamp":1665410718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-020-00468-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,13]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["468"],"URL":"https:\/\/doi.org\/10.1007\/s00200-020-00468-2","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,13]]},"assertion":[{"value":"20 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}