{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:49:49Z","timestamp":1768340989489,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T00:00:00Z","timestamp":1715904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T00:00:00Z","timestamp":1715904000000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10623-024-01420-y","type":"journal-article","created":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T14:03:01Z","timestamp":1715954581000},"page":"2901-2926","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["LCD codes and almost optimally extendable codes from self-orthogonal codes"],"prefix":"10.1007","volume":"92","author":[{"given":"Xinran","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2630-4446","authenticated-orcid":false,"given":"Ziling","family":"Heng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fengwei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,17]]},"reference":[{"issue":"2","key":"1420_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":"1420_CR2","first-page":"40","volume-title":"WISTP, Heraklion, LNCS","author":"J Bringer","year":"2014","unstructured":"Bringer J., Carlet C., Chabanne H., Guilley S., Maghrebi H.: Orthogonal direct sum masking a smartcard friendly computation paradigm in a code, with builtin protection against side-channel and fault attacks. In: Naccache D., Sauveron D. (eds.) WISTP, Heraklion, LNCS, vol. 8501, pp. 40\u201356. Springer, Heidelberg (2014)."},{"issue":"1","key":"1420_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(1), 131\u2013150 (2016).","journal-title":"Adv. Math. Commun."},{"key":"1420_CR4","doi-asserted-by":"crossref","unstructured":"Carlet C., Guilley S.: Complementary dual codes for counter-measures to side-channel attacks. In: Pinto E.R., et al. (eds.) Coding Theory and Applications, CIM Series in Mathematical Sciences, pp. 97\u2013105. Springer Verlag (2014).","DOI":"10.1007\/978-3-319-17296-5_9"},{"key":"1420_CR5","first-page":"95","volume-title":"Arithmetic of Finite Fields, WAIFI 2018, LNCS","author":"C Carlet","year":"2018","unstructured":"Carlet C., G\u00fcneri C., Mesnager S., \u00d3zbudak F.: Construction of some codes suitable for both side channel and fault injection attacks. In: Budaghyan L., Rodrguez-Henrquez F. (eds.) Arithmetic of Finite Fields, WAIFI 2018, LNCS, vol. 11321, pp. 95\u2013107. Springer, Cham (2018)."},{"key":"1420_CR6","doi-asserted-by":"publisher","first-page":"2813","DOI":"10.1007\/s10623-019-00652-7","volume":"87","author":"C Carlet","year":"2019","unstructured":"Carlet C., Li C., Mesnager S.: Some (almost) optimally extendable linear codes. Des. Codes Cryptogr. 87, 2813\u20132834 (2019).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1420_CR7","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>3$$. IEEE Trans. Inf. Theory 64(4), 3010\u20133017 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1420_CR8","unstructured":"Dillon J.F.: Elementary Hadamard difference sets. In: Hoffman F., et al. (eds.) Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 237\u2013249. Congressus Numerantium XIV, Winnipeg Utilitas Math (1975)."},{"key":"1420_CR9","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1109\/TIT.2015.2420118","volume":"60","author":"C Ding","year":"2015","unstructured":"Ding C.: Linear codes from some 2-designs. IEEE Trans. Inf. Theory 60, 3265\u20133275 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1420_CR10","doi-asserted-by":"publisher","DOI":"10.1142\/12697","volume-title":"Designs from Linear Codes","author":"C Ding","year":"2022","unstructured":"Ding C., Tang C.: Designs from Linear Codes, vol. 2nd. World Scientific, Singapore (2022)."},{"key":"1420_CR11","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1007\/s12095-020-00442-2","volume":"12","author":"C Ding","year":"2020","unstructured":"Ding C., Tang C.: Combinatorial $$t$$-designs from special functions. Cryptogr. Commun. 12, 1011\u20131033 (2020).","journal-title":"Cryptogr. Commun."},{"key":"1420_CR12","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":"11","key":"1420_CR13","doi-asserted-by":"publisher","first-page":"6872","DOI":"10.1109\/TIT.2020.3006846","volume":"66","author":"Z Heng","year":"2020","unstructured":"Heng Z., Wang Q., Ding C.: Two families of optimal linear codes and their subfield codes. IEEE Trans. Inf. Theory 66(11), 6872\u20136883 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1420_CR14","doi-asserted-by":"publisher","first-page":"644","DOI":"10.3934\/amc.2021014","volume":"17","author":"X Huang","year":"2023","unstructured":"Huang X., Yue Q., Wu Y., Shi X.: Ternary primitive LCD BCH codes. Adv. Math. Commun. 17(3), 644\u2013659 (2023).","journal-title":"Adv. Math. Commun."},{"key":"1420_CR15","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1007\/s10623-020-00795-y","volume":"88","author":"X Huang","year":"2020","unstructured":"Huang X., Yue Q., Wu Y., Shi X., Michel J.: Binary primitive LCD BCH codes. Des. Codes Cryptogr. 88, 2453\u20132473 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"1420_CR16","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997)."},{"issue":"7","key":"1420_CR17","doi-asserted-by":"publisher","first-page":"4344","DOI":"10.1109\/TIT.2017.2672961","volume":"63","author":"C Li","year":"2017","unstructured":"Li C., Ding C., Li S.: LCD cyclic codes over finite fields. IEEE Trans. Inf. Theory 63(7), 4344\u20134356 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1420_CR18","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2022053","author":"Y Liu","year":"2022","unstructured":"Liu Y., Kai X., Zhu S.: On binary LCD BCH codes of length $$\\frac{{{2^ m}+ 1}}{3} $$. Adv. Math. Commun. (2022). https:\/\/doi.org\/10.3934\/amc.2022053.","journal-title":"Adv. Math. Commun."},{"issue":"9","key":"1420_CR19","doi-asserted-by":"publisher","first-page":"2051","DOI":"10.1007\/s10623-021-00899-z","volume":"89","author":"H Liu","year":"2021","unstructured":"Liu H., Liu S.: Construction of MDS twisted Reed-Solomon codes and LCD MDS codes. Des. Codes Cryptogr. 89(9), 2051\u20132065 (2021).","journal-title":"Des. Codes Cryptogr."},{"key":"1420_CR20","volume-title":"Addition Theorems","author":"HB Mann","year":"1965","unstructured":"Mann H.B.: Addition Theorems. Wiley, New York (1965)."},{"key":"1420_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-32595-8","volume-title":"Bent Functions: Fundamentals and Results","author":"S Mesnager","year":"2016","unstructured":"Mesnager S.: Bent Functions: Fundamentals and Results, pp. 1\u2013544. Springer, New York (2016)."},{"issue":"107","key":"1420_CR22","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-C342 (1992).","journal-title":"Discret. Math."},{"key":"1420_CR23","unstructured":"Massey J.L.: Orthogonal, antiorthogonal and self-orthogonal matrices and their codes. In: Communications and Coding, pp. 3\u20139. Research Studies Press, Somerset (1998)."},{"key":"1420_CR24","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2022027","author":"X Quan","year":"2022","unstructured":"Quan X., Yue Q., Hu L.: Some constructions of (almost) optimally extendable linear codes. Adv. Math. Commun. (2022). https:\/\/doi.org\/10.3934\/amc.2022027.","journal-title":"Adv. Math. Commun."},{"issue":"1\u20133","key":"1420_CR25","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.disc.2004.05.005","volume":"285","author":"N Sendrier","year":"2004","unstructured":"Sendrier N.: Linear codes with complementary duals meet the Gilbert-Varshamov bound. Discret. Math. 285(1\u20133), 345\u2013347 (2004).","journal-title":"Discret. Math."},{"key":"1420_CR26","first-page":"477","volume":"5","author":"Z Wan","year":"1998","unstructured":"Wan Z.: A characteristic property of self-orthogonal codes and its application to lattices. Bull. Belg. Math. Soc. 5, 477\u2013482 (1998).","journal-title":"Bull. Belg. Math. Soc."},{"issue":"6","key":"1420_CR27","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1109\/LCOMM.2020.2982381","volume":"24","author":"Y Wu","year":"2020","unstructured":"Wu Y., Lee Y.: Binary LCD codes and self-orthogonal codes via simplicial complexes. IEEE Commun. Lett. 24(6), 1159\u20131162 (2020).","journal-title":"IEEE Commun. Lett."},{"issue":"8","key":"1420_CR28","doi-asserted-by":"publisher","first-page":"5069","DOI":"10.1109\/TIT.2021.3086818","volume":"67","author":"Y Wu","year":"2021","unstructured":"Wu Y., Hyun J.Y., Lee Y.: New LCD MDS codes of non-Reed-Solomon type. IEEE Trans. Inf. Theory 67(8), 5069\u20135078 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1420_CR29","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0012-365X(94)90283-6","volume":"126","author":"X Yang","year":"1994","unstructured":"Yang X., Massey J.L.: The condition for a cyclic code to have a complementary dual. J. Discret. Math. 126, 391\u2013393 (1994).","journal-title":"J. Discret. Math."},{"issue":"1","key":"1420_CR30","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TIT.2018.2823704","volume":"65","author":"Z Zhou","year":"2018","unstructured":"Zhou Z., Li X., Tang C., Ding C.: Binary LCD codes and self-orthogonal codes from a generic construction. IEEE Trans. Inf. Theory 65(1), 16\u201327 (2018).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01420-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01420-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01420-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T20:18:16Z","timestamp":1726690696000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01420-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,17]]},"references-count":30,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1420"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01420-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,17]]},"assertion":[{"value":"21 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 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 that they have no conflict of interest relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}