{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:38:37Z","timestamp":1760524717771,"version":"3.40.4"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["23K25784"],"award-info":[{"award-number":["23K25784"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["Discovery"],"award-info":[{"award-number":["Discovery"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s00373-025-02912-x","type":"journal-article","created":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T02:08:07Z","timestamp":1742695687000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unbiased Hadamard Matrices and Ternary Self-dual Codes"],"prefix":"10.1007","volume":"41","author":[{"given":"Masaaki","family":"Harada","sequence":"first","affiliation":[]},{"given":"Hadi","family":"Kharaghani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,21]]},"reference":[{"key":"2912_CR1","doi-asserted-by":"crossref","unstructured":"Abel,R.J.R., Colbourn,C.J., Dinitz,J.H.: Mutually orthogonal Latin squares (MOLS), in Handbook of Combinatorial Designs (C.J. Colbourn and J.H. Dinitz, eds.), Second Edition, Chapman and Hall\/CRC, Boca Raton, FL, 2007, pp.\u00a0160\u2013193","DOI":"10.1201\/9781420010541"},{"key":"2912_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s12095-010-0029-8","volume":"2","author":"D Best","year":"2010","unstructured":"Best, D., Kharaghani, H.: Unbiased complex Hadamard matrices and bases. Cryptogr. Commun. 2, 199\u2013209 (2010)","journal-title":"Cryptogr. Commun."},{"key":"2912_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: the user language. J. Symbolic Comput. 24, 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"key":"2912_CR4","doi-asserted-by":"crossref","unstructured":"Conway, J.H., Sloane, N.J.A.: Sphere Packing, Lattices and Groups, 3rd edn. Springer-Verlag, New York (1999)","DOI":"10.1007\/978-1-4757-6568-7"},{"key":"2912_CR5","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1142\/S0219749910006502","volume":"8","author":"T Durt","year":"2010","unstructured":"Durt, T., Englert, B.G., Bengtsson, I., \u0179yczkowski, K.: On mutually unbiased bases. Int. J. Quantum Inf. 8, 535\u2013640 (2010)","journal-title":"Int. J. Quantum Inf."},{"key":"2912_CR6","doi-asserted-by":"crossref","unstructured":"Harada,M., Ishizuka,K.: Hadamard matrices of order $$36$$ formed by codewords in some ternary self-dual codes, Discrete Math. 347 (2024), 113661, 10 pp","DOI":"10.1016\/j.disc.2023.113661"},{"key":"2912_CR7","doi-asserted-by":"crossref","unstructured":"Holzmann,W., Kharaghani,H., Orrick,W.: On the real unbiased Hadamard matrices, in: Combinatorics and Graphs, in: Contemp. Math., vol.\u00a0531, Amer. Math. Soc., Providence, RI, 2010, pp.\u00a0243\u2013250","DOI":"10.1090\/conm\/531\/10471"},{"key":"2912_CR8","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1006\/jcta.2000.3166","volume":"95","author":"Z Janko","year":"2001","unstructured":"Janko, Z.: The existence of a Bush-type Hadamard matrix of order $$36$$ and two new infinite classes of symmetric designs. J. Combin. Theory Ser. A 95, 360\u2013364 (2001)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2912_CR9","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1002\/jcd.21323","volume":"21","author":"H Kharaghani","year":"2013","unstructured":"Kharaghani, H., Tayfeh-Rezaie, B.: Hadamard matrices of order $$32$$. J. Combin. Designs 21, 212\u2013221 (2013)","journal-title":"J. Combin. Designs"},{"key":"2912_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0012-365X(94)90024-8","volume":"133","author":"H Kimura","year":"1994","unstructured":"Kimura, H.: Classification of Hadamard matrices of order $$28$$. Discrete Math. 133, 171\u2013180 (1994)","journal-title":"Discrete Math."},{"key":"2912_CR11","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/S0019-9958(73)90273-8","volume":"22","author":"CL Mallows","year":"1973","unstructured":"Mallows, C.L., Sloane, N.J.A.: An upper bound for self-dual codes, Inform. Control 22, 188\u2013200 (1973)","journal-title":"Control"},{"key":"2912_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0097-3165(72)90088-X","volume":"12","author":"V Pless","year":"1972","unstructured":"Pless, V.: Symmetry codes over $$GF(3)$$ and new five-designs. J. Combin. Theory Ser. A 12, 119\u2013142 (1972)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2912_CR13","unstructured":"Seberry,J.: Library of Hadamard Matrices, https:\/\/documents.uow.edu.au\/~jennie\/hadamard.html"},{"key":"2912_CR14","doi-asserted-by":"publisher","first-page":"2753","DOI":"10.1007\/s10623-021-00941-0","volume":"90","author":"VD Tonchev","year":"2022","unstructured":"Tonchev, V.D.: On Pless symmetry codes, ternary QR codes, and related Hadamard matrices and designs. Des. Codes Cryptogr. 90, 2753\u20132762 (2022)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02912-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02912-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02912-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:17:06Z","timestamp":1746253026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02912-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,21]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2912"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02912-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,3,21]]},"assertion":[{"value":"13 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2025","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 there are no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"50"}}