{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:55:15Z","timestamp":1761598515373,"version":"3.40.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T00:00:00Z","timestamp":1689292800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T00:00:00Z","timestamp":1689292800000},"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,5]]},"DOI":"10.1007\/s00200-023-00615-5","type":"journal-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T06:02:40Z","timestamp":1689314560000},"page":"457-470","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constructing doubly even self-dual codes and even unimodular lattices from Hadamard matrices"],"prefix":"10.1007","volume":"36","author":[{"given":"Dean","family":"Crnkovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"\u0160vob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,14]]},"reference":[{"key":"615_CR1","unstructured":"Adamovi\u0107, D., Crnkovi\u0107, D., \u0160vob, A.: Holomorphic vertex operator algebras obtained from Hadamard matrices, in preparation"},{"key":"615_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316529836","volume-title":"Designs and their codes, Cambridge Tracts in Math","author":"EF Assmus Jr","year":"1992","unstructured":"Assmus, E.F., Jr., Key, J.D.: Designs and their codes, Cambridge Tracts in Math, vol. 103. Cambridge University Press, Cambridge (1992)"},{"key":"615_CR3","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1109\/18.761269","volume":"45","author":"E Bannai","year":"1999","unstructured":"Bannai, E., Dougherty, S.T., Harada, M., Oura, M.: Type II codes, even unimodular lattices, and invariant rings. IEEE Trans. Inform. Theory 45, 1194\u20131205 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"615_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139507660","volume-title":"Design Theory","author":"T Beth","year":"1999","unstructured":"Beth, T., Jungnickel, D., Lenz, H.: Design Theory, vol. 1. Cambridge University Press, Cambridge (1999)"},{"issue":"3","key":"615_CR5","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\u201318 (2012)","journal-title":"Electron. J. Combin."},{"key":"615_CR6","doi-asserted-by":"publisher","first-page":"3068","DOI":"10.1073\/pnas.83.10.3068","volume":"83","author":"RB Borcherds","year":"1986","unstructured":"Borcherds, R.B.: Vertex algebras, Kac-Moody algebras, and the Monster. Proc. Natl. Acad. Sci. USA 83, 3068\u20133071 (1986)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"615_CR7","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":"615_CR8","unstructured":"Craigen, R., Kharaghani, H.: Hadamard Matrices and Hadamard Designs, in: Handbook of Combinatorial Designs, $$2^{\\rm nd}$$ ed., C.J. Colbourn, J.H. Dinitz (eds.), Chapman & Hall\/CRC Press, Boca Raton, pp. 273\u2013280 (2007)"},{"key":"615_CR9","first-page":"159","volume":"1","author":"D Crnkovi\u0107","year":"2008","unstructured":"Crnkovi\u0107, D., Mikuli\u0107, V.: Self-orthogonal doubly-even codes from Hadamard matrices of order 48. Adv. Appl. Discrete Math. 1, 159\u2013170 (2008)","journal-title":"Adv. Appl. Discrete Math."},{"key":"615_CR10","doi-asserted-by":"crossref","unstructured":"Farad\u017eev, I.A., Klin, M.H., Muzichuk, M.E.: Cellular rings and groups of automorphisms of graphs, in: Investigations in algebraic theory of combinatorial objects, I. A. Farad\u017eev, A. A. Ivanov, M. H. Klin, A. J. Woldar (eds.), Math. Appl. (Soviet Ser.), vol. 84, Kluwer Acad. Publ., Dordrecht, pp. 1\u2013152 (1994)","DOI":"10.1007\/978-94-017-1972-8_1"},{"key":"615_CR11","volume-title":"Vertex operator algebras and the Monster, Pure and Applied Mathematics","author":"IB Frenkel","year":"1988","unstructured":"Frenkel, I.B., Lepowsky, J., Meurman, A.: Vertex operator algebras and the Monster, Pure and Applied Mathematics, vol. 134. Academic Press, Cambridge (1988)"},{"key":"615_CR12","volume-title":"Combinatorial Theory","author":"M Hall Jr","year":"1986","unstructured":"Hall, M., Jr.: Combinatorial Theory, 2nd edn. Wiley, New York (1986)","edition":"2"},{"key":"615_CR13","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":"615_CR14","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1002\/jcd.20043","volume":"13","author":"H Kharaghani","year":"2005","unstructured":"Kharaghani, H., Tayfeh-Rezaie, B.: A Hadamard matrix of order 428. J. Combin. Des. 13, 435\u2013440 (2005)","journal-title":"J. Combin. Des."},{"key":"615_CR15","doi-asserted-by":"publisher","first-page":"2723","DOI":"10.1016\/j.disc.2006.06.037","volume":"308","author":"C Koukouvinos","year":"2008","unstructured":"Koukouvinos, C., Stylianou, S.: On skew-Hadamard matrices. Discrete Math. 308, 2723\u20132731 (2008)","journal-title":"Discrete Math."},{"key":"615_CR16","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":"615_CR17","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/j.ejc.2011.11.007","volume":"33","author":"A Munemasa","year":"2012","unstructured":"Munemasa, A., Tamura, H.: The codes and the lattices of Hadamard matrices. Eur. J. Combin. 33, 519\u2013533 (2012)","journal-title":"Eur. J. Combin."},{"key":"615_CR18","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-Verlag, Berlin (2006)"},{"key":"615_CR19","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/sapm1933121311","volume":"12","author":"REAC Paley","year":"1933","unstructured":"Paley, R.E.A.C.: On orthogonal matrices. J. Math. Phys. 12, 311\u2013320 (1933)","journal-title":"J. Math. Phys."},{"key":"615_CR20","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). Discrete Math. 3, 209\u2013246 (1972)","journal-title":"Discrete Math."},{"key":"615_CR21","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0097-3165(75)90042-4","volume":"18","author":"V Pless","year":"1975","unstructured":"Pless, V., Sloane, N.J.A.: On the classification and enumeration of self-dual codes. J. Combin. Theory Ser. A 18, 313\u2013335 (1975)","journal-title":"J. Combin. Theory Ser. A"},{"key":"615_CR22","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":"615_CR23","unstructured":"Tonchev, V.D.: Codes, in: Handbook of Combinatorial Designs, 2nd ed., C. J. Colbourn, J. H. Dinitz (eds.), Chapman & Hall\/CRC Press, Boca Raton, pp. 667\u2013702 (2007)"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-023-00615-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-023-00615-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-023-00615-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T11:32:06Z","timestamp":1744371126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-023-00615-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,14]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["615"],"URL":"https:\/\/doi.org\/10.1007\/s00200-023-00615-5","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"type":"print","value":"0938-1279"},{"type":"electronic","value":"1432-0622"}],"subject":[],"published":{"date-parts":[[2023,7,14]]},"assertion":[{"value":"6 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2023","order":3,"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"}}]}}