{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T17:22:38Z","timestamp":1783099358387,"version":"3.54.6"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T00:00:00Z","timestamp":1570492800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T00:00:00Z","timestamp":1570492800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"JSPS","award":["JSPS KAKENHI Grant Number 15H03633"],"award-info":[{"award-number":["JSPS KAKENHI Grant Number 15H03633"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s12095-019-00402-5","type":"journal-article","created":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T07:04:01Z","timestamp":1570518241000},"page":"285-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["On the minimum weights of binary linear complementary dual codes"],"prefix":"10.1007","volume":"12","author":[{"given":"Makoto","family":"Araya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Masaaki","family":"Harada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,10,8]]},"reference":[{"key":"402_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1023\/A:1011203416769","volume":"23","author":"K Betsumiya","year":"2001","unstructured":"Betsumiya, K., Harada, M.: Binary optimal odd formally self-dual codes. Des. Codes Crypt. 23, 11\u201321 (2001)","journal-title":"Des. Codes Crypt."},{"key":"402_CR2","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. Symb. Comput. 24, 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"402_CR3","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":"402_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TIT.2018.2829873","volume":"65","author":"C Carlet","year":"2019","unstructured":"Carlet, C., Mesnager, S., Tang, C., Qi, Y.: New characterization and parametrization of LCD codes. IEEE Trans. Inform. Theory 65, 39\u201349 (2019)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"402_CR5","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., Pellikaan, R.: Linear codes over $\\mathbb {F}_{q}$ are equivalent to LCD codes for q >\u20093. IEEE Trans. Inform. Theory 64, 3010\u20133017 (2018)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"402_CR6","first-page":"38","volume":"29","author":"SM Dodunekov","year":"1993","unstructured":"Dodunekov, S.M., Encheva, S.B.: Uniqueness of some linear subcodes of the binary extended Golay code. Probl. Inf. Transm. 29, 38\u201343 (1993)","journal-title":"Probl. Inf. Transm."},{"key":"402_CR7","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1504\/IJICOT.2017.083827","volume":"4","author":"ST Dougherty","year":"2017","unstructured":"Dougherty, S.T., Kim, J.-L., Ozkaya, B., Sok, L., Sol\u00e9, P.: The combinatorics of LCD codes: linear programming bound and orthogonal matrices. Int. J. Inf. Coding Theory 4, 116\u2013128 (2017)","journal-title":"Int. J. Inf. Coding Theory"},{"key":"402_CR8","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s12095-017-0258-1","volume":"10","author":"L Galvez","year":"2018","unstructured":"Galvez, L., Kim, J.-L., Lee, N., Roe, Y.G., Won, B.-S.: Some bounds on binary LCD codes. Cryptogr. Commun. 10, 719\u2013728 (2018)","journal-title":"Cryptogr. Commun."},{"key":"402_CR9","unstructured":"Grassl, M.: Code tables: Bounds on the parameters of various types of codes, Available online at \nhttp:\/\/www.codetables.de\/\n\n, Accessed on 2018-04-06"},{"key":"402_CR10","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"JH Griesmer","year":"1960","unstructured":"Griesmer, J.H.: A bound for error-correcting codes. IBM J. Res. Develop. 4, 532\u2013542 (1960)","journal-title":"IBM J. Res. Develop."},{"key":"402_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.disc.2003.10.027","volume":"283","author":"TA Gulliver","year":"2004","unstructured":"Gulliver, T.A., \u00d6sterg\u00e5rd, P.R.J.: Binary optimal linear rate 1\/2 codes. Discrete Math. 283, 255\u2013261 (2004)","journal-title":"Discrete Math."},{"key":"402_CR12","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":"402_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0012-365X(99)00135-1","volume":"223","author":"DB Jaffe","year":"2000","unstructured":"Jaffe, D.B.: Optimal binary linear codes of length \u2264\u200930. Discrete Math. 223, 135\u2013155 (2000)","journal-title":"Discrete Math."},{"key":"402_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0012-365X(92)90563-U","volume":"106\/107","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":"402_CR15","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symbolic Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symbolic Comput."},{"key":"402_CR16","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032749","volume-title":"Introduction to the Theory of Error-Correcting Codes","author":"V Pless","year":"1998","unstructured":"Pless, V.: Introduction to the Theory of Error-Correcting Codes, 3rd edn. Wiley, New York (1998)","edition":"3rd edn."},{"key":"402_CR17","unstructured":"Shoup, V.: NTL: A Library for doing Number Theory, Available online at \nhttp:\/\/www.shoup.net\/ntl\/"},{"key":"402_CR18","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0012-365X(92)90574-Y","volume":"106\/107","author":"J Simonis","year":"1992","unstructured":"Simonis, J.: The [18, 9, 6] code is unique. Discrete Math. 106\/107, 439\u2013448 (1992)","journal-title":"Discrete Math."},{"key":"402_CR19","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0012-365X(99)00187-9","volume":"213","author":"J Simonis","year":"2000","unstructured":"Simonis, J.: The [23, 14, 5] Wagner code is unique. Discrete Math. 213, 269\u2013282 (2000)","journal-title":"Discrete Math."},{"key":"402_CR20","unstructured":"Snover, S.L.: The Uniqueness of the Nordstrom\u2013Robinson and the Golay Binary Codes, Ph.D Thesis, Michigan State Univ. (1973)"},{"key":"402_CR21","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/S0019-9958(80)90115-1","volume":"44","author":"H van Tilborg","year":"1980","unstructured":"van Tilborg, H.: On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound. Inform. Control. 44, 16\u201335 (1980)","journal-title":"Inform. Control."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-019-00402-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-019-00402-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-019-00402-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T23:45:19Z","timestamp":1602027919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-019-00402-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,8]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["402"],"URL":"https:\/\/doi.org\/10.1007\/s12095-019-00402-5","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,8]]},"assertion":[{"value":"13 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}