{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:08:35Z","timestamp":1761595715165,"version":"build-2065373602"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T00:00:00Z","timestamp":1719187200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T00:00:00Z","timestamp":1719187200000},"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":["AAECC"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s00200-024-00664-4","type":"journal-article","created":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T11:01:42Z","timestamp":1719226902000},"page":"1253-1265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Doubly even self-orthogonal codes from quasi-symmetric designs"],"prefix":"10.1007","volume":"36","author":[{"given":"Dean","family":"Crnkovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doris","family":"Dumi\u010di\u0107 Danilovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana","family":"\u0160umberac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"\u0160vob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,24]]},"reference":[{"key":"664_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.disc.2010.10.005","volume":"311","author":"M Behbahani","year":"2011","unstructured":"Behbahani, M., Lam, C.: Strongly regular graphs with non-trivial automorphisms. Discret. Math. 311, 132\u2013144 (2011)","journal-title":"Discret. Math."},{"issue":"3","key":"664_CR2","doi-asserted-by":"publisher","first-page":"12","DOI":"10.37236\/2593","volume":"19","author":"K Betsumiya","year":"2012","unstructured":"Betsumiya, K., Harada, M., Munemasa, A.: A complete classification of doubly even self-dual codes of length 40. Electron. J. Combin. 19(3), 12 (2012)","journal-title":"Electron. J. Combin."},{"key":"664_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0378-3758(00)00281-0","volume":"95","author":"A Blokhuis","year":"2001","unstructured":"Blokhuis, A., Haemers, W.H.: An infinite family of quasi-symmetric designs. J. Stat. Plan. Inference 95, 117\u2013119 (2001)","journal-title":"J. Stat. Plan. Inference"},{"key":"664_CR4","volume-title":"Handbook of Magma Functions","author":"W Bosma","year":"1994","unstructured":"Bosma, W., Cannon, J.: Handbook of Magma Functions. Department of Mathematics, University of Sydney, Sydney (1994)"},{"key":"664_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1112\/blms\/18.2.97","volume":"18","author":"R Calderbanak","year":"1986","unstructured":"Calderbanak, R., Kantor, W.M.: The geometry of two-weight codes. Bull. Lond. Math. Soc. 18, 97\u2013122 (1986)","journal-title":"Bull. Lond. Math. Soc."},{"key":"664_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(92)90003-D","volume":"60","author":"JH Conway","year":"1992","unstructured":"Conway, J.H., Pless, V., Sloane, N.J.A.: The binary self-dual codes of length up to 32: a revised enumeration. J. Combin. Theory Ser. A 60, 183\u2013195 (1992)","journal-title":"J. Combin. Theory Ser. A"},{"key":"664_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0012-365X(00)00364-2","volume":"237","author":"D Crnkovi\u0107","year":"2001","unstructured":"Crnkovi\u0107, D., Pav\u010devi\u0107, M.-O.: Some new symmetric designs with parameters (64,28,12). Discret. Math. 237, 109\u2013118 (2001)","journal-title":"Discret. Math."},{"key":"664_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-023-00615-5","author":"D Crnkovi\u0107","year":"2023","unstructured":"Crnkovi\u0107, D., \u0160vob, A.: Constructing doubly even self-dual codes and even unimodular lattices from Hadamard matrices. Appl. Algebra Eng. Commun. Comput. (2023). https:\/\/doi.org\/10.1007\/s00200-023-00615-5","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"664_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112623","volume":"344","author":"D Crnkovi\u0107","year":"2021","unstructured":"Crnkovi\u0107, D., \u0160vob, A.: New symmetric 2-(176,50,14) designs. Discret. Math. 344, 112623 (2021)","journal-title":"Discret. Math."},{"key":"664_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.55016\/ojs\/cdm.v15i1.62323","volume":"15","author":"D Crnkovi\u0107","year":"2020","unstructured":"Crnkovi\u0107, D., Maksimovi\u0107, M.: Construction of strongly regular graphs having an automorphism group of composite order. Contrib. Discret. Math. 15, 22\u201341 (2020)","journal-title":"Contrib. Discret. Math."},{"key":"664_CR11","doi-asserted-by":"publisher","first-page":"555","DOI":"10.3934\/amc.2016026","volume":"10","author":"D Crnkovi\u0107","year":"2016","unstructured":"Crnkovi\u0107, D., Maksimovi\u0107, M., Rodrigues, B.G., Rukavina, S.: Self-orthogonal codes from the strongly regular graphs on up to 40 vertices. Adv. Math. Commun. 10, 555\u2013582 (2016)","journal-title":"Adv. Math. Commun."},{"key":"664_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.3934\/amc.2013.7.161","volume":"7","author":"D Crnkovi\u0107","year":"2013","unstructured":"Crnkovi\u0107, D., Rodrigues, B.G., Rukavina, S., Sim\u010di\u0107, L.: Self-orthogonal codes from orbit matrices of 2-designs. Adv. Math. Commun. 7, 161\u2013174 (2013)","journal-title":"Adv. Math. Commun."},{"key":"664_CR13","doi-asserted-by":"publisher","first-page":"2472","DOI":"10.1016\/j.disc.2017.06.008","volume":"340","author":"D Crnkovi\u0107","year":"2017","unstructured":"Crnkovi\u0107, D., Rodrigues, B.G., Rukavina, S., Tonchev, V.D.: Quasi-symmetric 2-(64,24,46) designs derived from AG(3,4). Discret. Math. 340, 2472\u20132478 (2017)","journal-title":"Discret. Math."},{"key":"664_CR14","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/(SICI)1520-6610(1998)6:3<213::AID-JCD3>3.0.CO;2-I","volume":"6","author":"YS Ding","year":"1998","unstructured":"Ding, Y.S., Houghten, S., Lam, C., Smith, S., Thiel, L., Tonchev, V.: Quasi-symmetric 2-(28,12,11) designs with an automorphism of order 7. J. Combin. Des. 6, 213\u2013223 (1998)","journal-title":"J. Combin. Des."},{"key":"664_CR15","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes (2023). http:\/\/www.codetables.de. Accessed 9 July 2023"},{"key":"664_CR16","first-page":"288","volume":"70","author":"M Harada","year":"2018","unstructured":"Harada, M., Saito, K.: Singly even self-dual codes constructed from Hadamard matrices of order 28. Australas. J. Combin. 70, 288\u2013296 (2018)","journal-title":"Australas. J. Combin."},{"key":"664_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0012-365X(02)00553-8","volume":"264","author":"M Harada","year":"2003","unstructured":"Harada, M., Tonchev, V.D.: Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms. Discret. Math. 264, 81\u201390 (2003)","journal-title":"Discret. Math."},{"key":"664_CR18","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)"},{"issue":"1992","key":"664_CR19","first-page":"275","volume":"52","author":"Z Janko","year":"1990","unstructured":"Janko, Z.: Coset enumeration in groups and construction of symmetric designs. Ann. Discret. Math. 52(1992), 275\u2013277 (1990)","journal-title":"Ann. Discret. Math."},{"key":"664_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0012-365X(91)90442-5","volume":"97","author":"Z Janko","year":"1991","unstructured":"Janko, Z., Tonchev, V.D.: Cyclic 2-(91,6,1) designs with multiplier automorphisms. Discret. Math. 97, 265\u2013268 (1991)","journal-title":"Discret. Math."},{"key":"664_CR21","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0097-3165(85)90107-4","volume":"40","author":"Z Janko","year":"1985","unstructured":"Janko, Z., van Trung, T.: Construction of a new symmetric block design for (78,22,6) with the help of tactical decompositions. J. Combin. Theory Ser. A 40, 451\u2013455 (1985)","journal-title":"J. Combin. Theory Ser. A"},{"key":"664_CR22","first-page":"419","volume-title":"Handbook of Combinatorial Designs","author":"D Jungnickel","year":"2007","unstructured":"Jungnickel, D., Pott, A., Smith, K.W.: Difference sets. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn., pp. 419\u2013435. Chapman & Hall\/CRC Press, Boca Raton (2007)","edition":"2"},{"key":"664_CR23","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10623-015-0065-7","volume":"77","author":"D Jungnickel","year":"2015","unstructured":"Jungnickel, D., Tonchev, V.D.: Maximal arcs and quasi-symmetric designs. Des. Codes Cryptogr. 77, 365\u2013374 (2015)","journal-title":"Des. Codes Cryptogr."},{"key":"664_CR24","doi-asserted-by":"publisher","first-page":"2118","DOI":"10.1016\/j.dam.2007.10.030","volume":"157","author":"A Kohnert","year":"2009","unstructured":"Kohnert, A., Wassermann, A.: Construction of binary and ternary self-orthogonal linear codes. Discret. Appl. Math. 157, 2118\u20132123 (2009)","journal-title":"Discret. Appl. Math."},{"key":"664_CR25","doi-asserted-by":"publisher","first-page":"633","DOI":"10.3934\/amc.2020086","volume":"15","author":"V Kr\u010dadinac","year":"2021","unstructured":"Kr\u010dadinac, V., Vlahovi\u0107 Kruc, R.: Quasi-symmetric designs on 56 points. Adv. Math. Commun. 15, 633\u2013646 (2021)","journal-title":"Adv. Math. Commun."},{"key":"664_CR26","doi-asserted-by":"publisher","first-page":"368","DOI":"10.2307\/2034778","volume":"11","author":"PK Menon","year":"1960","unstructured":"Menon, P.K.: Difference sets in abelian groups. Proc. Am. Math. Soc. 11, 368\u2013376 (1960)","journal-title":"Proc. Am. Math. Soc."},{"key":"664_CR27","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s10623-021-00842-2","volume":"89","author":"T Miezaki","year":"2021","unstructured":"Miezaki, T.: Design-theoretic analogies between codes, lattices, and vertex operator algebras. Des. Codes Cryptogr. 89, 763\u2013780 (2021)","journal-title":"Des. Codes Cryptogr."},{"key":"664_CR28","volume-title":"Self-Dual Codes and Invariant Theory, Algorithms and Computation in Mathematics","author":"G Nebe","year":"2006","unstructured":"Nebe, G., Rains, E.M., Sloane, N.J.A.: Self-Dual Codes and Invariant Theory, Algorithms and Computation in Mathematics, vol. 17. Springer, Cham (2006)"},{"key":"664_CR29","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0012-365X(72)90034-9","volume":"3","author":"V Pless","year":"1972","unstructured":"Pless, V.: A classification of self-orthogonal codes over GF(2). Discret. Math. 3, 209\u2013246 (1972)","journal-title":"Discret. Math."},{"key":"664_CR30","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/18.651000","volume":"44","author":"EM Rains","year":"1988","unstructured":"Rains, E.M.: Shadow bounds for self-dual codes. IEEE Trans. Inf. Theory 44, 134\u2013139 (1988)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"664_CR31","first-page":"578","volume-title":"Handbook of Combinatorial Designs","author":"MS Shrikhande","year":"2007","unstructured":"Shrikhande, M.S.: Quasi-symmetric designs. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn., pp. 578\u2013582. Chapman & Hall\/CRC Press, Boca Raton (2007)","edition":"2"},{"key":"664_CR32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511665615","volume-title":"Quasi-symmetric designs","author":"MS Shrikhande","year":"1991","unstructured":"Shrikhande, M.S., Sane, S.S.: Quasi-symmetric designs. Cambridge University Press, Cambridge (1991)"},{"key":"664_CR33","first-page":"399","volume":"25","author":"SS Shrikhande","year":"1963","unstructured":"Shrikhande, S.S., Raghavarao, D.: A method of construction of incomplete block designs. Sankhy\u0101 Ser. A 25, 399\u2013402 (1963)","journal-title":"Sankhy\u0101 Ser. A"},{"key":"664_CR34","first-page":"667","volume-title":"Handbook of Combinatorial Designs","author":"VD Tonchev","year":"2007","unstructured":"Tonchev, V.D.: Codes. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn., pp. 667\u2013702. Chapman & Hall\/CRC Press, Boca Raton (2007)","edition":"2"},{"key":"664_CR35","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0012-365X(95)00245-R","volume":"149","author":"VD Tonchev","year":"1996","unstructured":"Tonchev, V.D.: The uniformly packed binary [27,21,3] and [35,29,3] codes. Discret. Math. 149, 283\u2013288 (1996)","journal-title":"Discret. Math."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-024-00664-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-024-00664-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-024-00664-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:02:34Z","timestamp":1761595354000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-024-00664-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,24]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["664"],"URL":"https:\/\/doi.org\/10.1007\/s00200-024-00664-4","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"type":"print","value":"0938-1279"},{"type":"electronic","value":"1432-0622"}],"subject":[],"published":{"date-parts":[[2024,6,24]]},"assertion":[{"value":"19 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}