{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,19]],"date-time":"2026-08-19T22:45:32Z","timestamp":1787179532173,"version":"3.56.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T00:00:00Z","timestamp":1685750400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T00:00:00Z","timestamp":1685750400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004488","name":"Hrvatska Zaklada za Znanost","doi-asserted-by":"publisher","award":["5713"],"award-info":[{"award-number":["5713"]}],"id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s10623-023-01251-3","type":"journal-article","created":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T08:02:05Z","timestamp":1685779325000},"page":"3215-3226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["LCD subspace codes"],"prefix":"10.1007","volume":"91","author":[{"given":"Dean","family":"Crnkovi\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6558-5167","authenticated-orcid":false,"given":"Andrea","family":"\u0160vob","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"issue":"2","key":"1251_CR1","doi-asserted-by":"publisher","first-page":"272","DOI":"10.3390\/math8020272","volume":"8","author":"A Alahmadi","year":"2020","unstructured":"Alahmadi A., Altassan A., AlKenani A., \u00c7alkavur S., Shoaib H., Sol\u00e9 P.: A multisecret-sharing scheme based on LCD codes. Mathematics 8(2), 272 (2020).","journal-title":"Mathematics"},{"key":"1251_CR2","doi-asserted-by":"publisher","first-page":"101925","DOI":"10.1016\/j.ffa.2021.101925","volume":"76","author":"M Araya","year":"2021","unstructured":"Araya M., Harada M., Saito K.: On the minimum weights of binary LCD codes and ternary LCD codes. Finite Fields Appl. 76, 101925 (2021).","journal-title":"Finite Fields Appl."},{"issue":"1","key":"1251_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s00022-021-00572-9","volume":"112","author":"D Bartoli","year":"2021","unstructured":"Bartoli D., Riet A.-E., Storme L., Vandendriessche P.: Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes. J. Geom. 112(1), 12 (2021).","journal-title":"J. Geom."},{"key":"1251_CR4","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":"1251_CR5","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, Camperdown (1994)."},{"key":"1251_CR6","doi-asserted-by":"publisher","first-page":"2445","DOI":"10.1007\/s10623-021-00929-w","volume":"89","author":"S Bouyuklieva","year":"2021","unstructured":"Bouyuklieva S.: Optimal binary LCD codes. Des. Codes Cryptogr. 89, 2445\u20132461 (2021).","journal-title":"Des. Codes Cryptogr."},{"key":"1251_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"AE Brouwer","year":"1989","unstructured":"Brouwer A.E., Cohen A.M., Neumaier A.: Distance-Regular Graphs. Springer-Verlag, Berlin (1989)."},{"key":"1251_CR8","first-page":"1","volume":"35","author":"PJ Cameron","year":"1973","unstructured":"Cameron P.J., Seidel J.J.: Quadratic forms over GF(2). Nederl. Akad. Wetensch. Proc. Ser. A 76=Indag. Math 35, 1\u20138 (1973).","journal-title":"Nederl. Akad. Wetensch. Proc. Ser. A 76=Indag. Math"},{"key":"1251_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.3934\/amc.2016.10.131","volume":"10","author":"C Carlet","year":"2016","unstructured":"Carlet C., Guilley S.: Complementary dual codes for counter-measures to side-channel attacks. Adv. Math. Commun. 10, 131\u2013150 (2016).","journal-title":"Adv. Math. Commun."},{"key":"1251_CR10","doi-asserted-by":"publisher","first-page":"3010","DOI":"10.1109\/TIT.2018.2789347","volume":"64","author":"C Carlet","year":"2018","unstructured":"Carlet C., Mesnager S., Tang C., Qi Y.: Linear codes over $$F_q$$ which are equivalent to LCD codes for $$q>3$$. IEEE Trans. Inf. Theory 64, 3010\u20133017 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1251_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00200-019-00409-8","volume":"32","author":"D Crnkovi\u0107","year":"2021","unstructured":"Crnkovi\u0107 D., Egan R., Rodrigues B.G., \u0160vob A.: LCD codes from weighing matrices. Appl. Algebra Eng. Commun. Comput. 32, 175\u2013189 (2021).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"1251_CR12","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1016\/j.disc.2018.01.018","volume":"341","author":"D Crnkovi\u0107","year":"2018","unstructured":"Crnkovi\u0107 D., Egan R., \u0160vob A.: Orbit matrices of Hadamard matrices and related codes. Discret. Math. 341, 1199\u20131209 (2018).","journal-title":"Discret. Math."},{"key":"1251_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10801-021-01104-z","volume":"55","author":"D Crnkovi\u0107","year":"2022","unstructured":"Crnkovi\u0107 D., Rukavina S., \u0160vob A.: Self-orthogonal codes from equitable partitions of association schemes. J. Algebr. Comb. 55, 157\u2013171 (2022).","journal-title":"J. Algebr. Comb."},{"key":"1251_CR14","volume-title":"Network Coding and Subspace Designs. Signals and Communication Technology","year":"2018","unstructured":"Greferath M., Pav\u010devi\u0107 M.O., Silberstein N., V\u00e1zquez-Castro M. (eds.): Network Coding and Subspace Designs. Signals and Communication Technology. Springer, Cham (2018)."},{"key":"1251_CR15","unstructured":"Heinlein D., Kiermaier M., Kurz S., Wassermann A.: Tables of subspace codes. arXiv:1601.02864v2 (2017)"},{"key":"1251_CR16","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10623-018-0544-8","volume":"87","author":"D Heinlein","year":"2019","unstructured":"Heinlein D., Honold T., Kiermaier M., Kurz S., Wassermann A.: Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6. Des. Codes Cryptogr. 87, 375\u2013391 (2019).","journal-title":"Des. Codes Cryptogr."},{"key":"1251_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.laa.2021.03.019","volume":"621","author":"L Hernandez Lucas","year":"2021","unstructured":"Hernandez Lucas L., Landjev I., Storme L., Vandendriessche P.: A stability result and a spectrum result on constant dimension codes. Linear Algebra Appl. 621, 193\u2013213 (2021).","journal-title":"Linear Algebra Appl."},{"key":"1251_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/conm\/531\/10471","volume-title":"Contemporary Mathematics, Combinatorics and Graphs","author":"WH Holzmann","year":"2010","unstructured":"Holzmann W.H., Kharaghani H., Orrick W.: On the real unbiased Hadamard matrices. In: Brualdi R.A., Hedayat S., Kharaghani H., Khosrovshahi G.B., Shahriari S. (eds.) Contemporary Mathematics, Combinatorics and Graphs, vol. 531, pp. 243\u2013250. American Mathematical Society, Providence (2010)."},{"key":"1251_CR19","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":"1251_CR20","first-page":"312","volume-title":"Information Security, Coding Theory and Related Combinatorics, NATO Science for Peace and Security Series\u2014D: Information and Communication Security","author":"H Kharaghani","year":"2011","unstructured":"Kharaghani H.: Unbiased Hadamard matrices and bases. In: Crnkovi\u0107 D., Tonchev V. (eds.) Information Security, Coding Theory and Related Combinatorics, NATO Science for Peace and Security Series\u2014D: Information and Communication Security, vol. 29, pp. 312\u2013325. IOS, Amsterdam (2011)."},{"issue":"3","key":"1251_CR21","doi-asserted-by":"publisher","first-page":"P3.10","DOI":"10.37236\/4915","volume":"22","author":"H Kharaghani","year":"2015","unstructured":"Kharaghani H., Sasani S., Suda S.: Mutually unbiased bush-type Hadamard matrices and association schemes. Electron. J. Combin. 22(3), P3.10 (2015).","journal-title":"Electron. J. Combin."},{"key":"1251_CR22","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. Comb. Des. 13, 435\u2013440 (2005).","journal-title":"J. Comb. Des."},{"key":"1251_CR23","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R K\u00f6tter","year":"2008","unstructured":"K\u00f6tter R., Kschischang F.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54, 3579\u20133591 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"107","key":"1251_CR24","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. Discret. Math. 106(107), 337\u2013342 (1992).","journal-title":"Discret. Math."},{"key":"1251_CR25","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.disc.2004.05.005","volume":"304","author":"N Sendrier","year":"2004","unstructured":"Sendrier N.: Linear codes with complementary duals meet the Gilbert\u2013Varshamov bound. Discret. Math. 304, 345\u2013347 (2004).","journal-title":"Discret. Math."},{"key":"1251_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-021-00532-5","author":"A \u0160vob","year":"2023","unstructured":"\u0160vob A.: LCD codes from equitable partitions of association schemes. Appl. Algebra Eng. Commun. Comput. (2023). https:\/\/doi.org\/10.1007\/s00200-021-00532-5.","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"1251_CR27","unstructured":"The GAP Group. GAP\u2014Groups: Algorithms, and Programming, Version 4.8.4. http:\/\/www.gap-system.org (2016)"},{"key":"1251_CR28","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1018628204156","volume":"10","author":"E van Dam","year":"1999","unstructured":"van Dam E.: Three-class association schemes. J. Algebr. Comb. 10, 69\u2013107 (1999).","journal-title":"J. Algebr. Comb."},{"key":"1251_CR29","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s12095-020-00463-x","volume":"13","author":"H Zhang","year":"2021","unstructured":"Zhang H., Cao X.: Further constructions of cyclic subspace codes. Cryptogr. Commun. 13, 245\u2013262 (2021).","journal-title":"Cryptogr. Commun."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01251-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01251-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01251-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T14:05:26Z","timestamp":1695909926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01251-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,3]]},"references-count":29,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1251"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01251-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,3]]},"assertion":[{"value":"5 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}