{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T09:01:41Z","timestamp":1781168501226,"version":"3.54.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:00:00Z","timestamp":1747785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:00:00Z","timestamp":1747785600000},"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":[[2026,7]]},"DOI":"10.1007\/s00200-025-00693-7","type":"journal-article","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T10:47:00Z","timestamp":1747824420000},"page":"783-801","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Construction of additive complementary dual codes over finite fields"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-7702","authenticated-orcid":false,"given":"Gyanendra K.","family":"Verma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5666-4103","authenticated-orcid":false,"given":"R. K.","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,21]]},"reference":[{"issue":"1","key":"693_CR1","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.\u00a010(1), 131\u2013150 (2016)","journal-title":"Adv Math Commun"},{"key":"693_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0012-365X(92)90563-U","volume":"106\u2013107","author":"JL Massey","year":"1992","unstructured":"Massey, J.L.: Linear codes with complementary duals. Discret. Math. 106\u2013107, 337\u2013342 (1992)","journal-title":"Discret. Math."},{"key":"693_CR3","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/S0019-9958(64)90438-3","volume":"7","author":"JL Massey","year":"1964","unstructured":"Massey, J.L.: Reversible codes. Inf. Control 7, 369\u2013380 (1964)","journal-title":"Inf. Control"},{"key":"693_CR4","doi-asserted-by":"publisher","first-page":"2477","DOI":"10.1109\/18.720545","volume":"44","author":"P Delsarte","year":"1998","unstructured":"Delsarte, P., Levenshtein, V.I.: Association schemes and coding theory. IEEE Trans. Inf. Theory 44, 2477\u20132504 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"693_CR5","first-page":"97","volume":"10","author":"P Delsarte","year":"1973","unstructured":"Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl.\u00a010, 97 (1973)","journal-title":"Philips Res Rep Suppl"},{"issue":"2","key":"693_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10623-009-9316-9","volume":"54","author":"J Borges","year":"2010","unstructured":"Borges, J., Fern\u00e1ndez-C\u00f3rdoba, C., Pujol, J., Rif\u00e0, J., Villanueva, M.: Linear codes: generator matrices and duality. Design Codes Cryptogr.\u00a054(2), 167\u2013179 (2010). https:\/\/doi.org\/10.1007\/s10623-009-9316-9","journal-title":"Design Codes Cryptogr"},{"issue":"11","key":"693_CR7","doi-asserted-by":"publisher","first-page":"7232","DOI":"10.1109\/TIT.2021.3111858","volume":"67","author":"M Shi","year":"2021","unstructured":"Shi, M., Li, S., Sol\u00e9, P.: $$\\mathbb{Z} _2\\mathbb{Z} _4$$-additive quasi-cyclic codes. IEEE Trans. Inf. Theory 67(11), 7232\u20137239 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"693_CR8","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.12785\/amis\/070617","volume":"7","author":"I Aydogdu","year":"2013","unstructured":"Aydogdu, I., Siap, I.: The structure of $$\\mathbb{Z} _2 \\mathbb{Z} _{2^s}$$-additive codes: Bounds on the minimum distance. Appl. Math. Inf. Sci.\u00a07, 2271\u20132278 (2013)","journal-title":"Appl Math Inf Sci"},{"key":"693_CR9","doi-asserted-by":"publisher","first-page":"1806","DOI":"10.1080\/00207160.2013.859854","volume":"92","author":"I Aydogdu","year":"2015","unstructured":"Aydogdu, I., Abualrub, T., Siap, I.: On $$\\mathbb{Z} _2\\mathbb{Z} _2$$-additive codes. Int. J. Comput. Math. 92, 1806\u20131814 (2015)","journal-title":"Int. J. Comput. Math."},{"issue":"3","key":"693_CR10","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1080\/00207160.2015.1112380","volume":"94","author":"RK Bandi","year":"2017","unstructured":"Bandi, R.K., Bhaintwal, M.: Negacyclic codes of length $$2^k$$ over $${\\mathbb{Z} }_{4}+{{u}{\\mathbb{Z} }}_{4}$$. Int. J. Comput. Math. 94(3), 454\u2013470 (2017). https:\/\/doi.org\/10.1080\/00207160.2015.1112380","journal-title":"Int. J. Comput. Math."},{"issue":"6","key":"693_CR11","doi-asserted-by":"publisher","first-page":"3841","DOI":"10.1109\/TIT.2018.2883759","volume":"65","author":"M Shi","year":"2018","unstructured":"Shi, M., Wu, R., Krotov, D.S.: On $$\\mathbb{Z} _p\\mathbb{Z} _{p^k}$$-additive codes and their duality. IEEE Trans. Inf. Theory 65(6), 3841\u20133847 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"693_CR12","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1140\/epjp\/s13360-022-02429-9","volume":"137","author":"RK Verma","year":"2022","unstructured":"Verma, R.K., Prakash, O., Islam, H., Singh, A.K.: New non-binary quantum codes from skew constacyclic and additive skew constacyclic codes. Eur. Phys. J. Plus 137, 213 (2022)","journal-title":"Eur Phys J Plus"},{"key":"693_CR13","unstructured":"Debnath, I., Singh, A.K., Prakash, O., Alhevaz, A.: Quantum codes from additive constacyclic codes over a mixed alphabet and the macwilliams identities. ArXiv: 2212.13169 (2022)"},{"key":"693_CR14","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s12095-021-00545-4","volume":"14","author":"M Shi","year":"2022","unstructured":"Shi, M., Li, S., Kim, J.-L., Sol\u00e9, P.: Lcd and acd codes over a noncommutative non-unital ring with four elements. Cryptogr. Commun. 14, 627\u2013640 (2022)","journal-title":"Cryptogr. Commun."},{"key":"693_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2022.102087","volume":"83","author":"M Shi","year":"2022","unstructured":"Shi, M., Liu, N., \u00d6zbudak, F., Sol\u00e9, P.: Additive cyclic complementary dual codes over $$\\mathbb{F} _4$$. Finite Fields Appl.\u00a083, 102087 (2022)","journal-title":"Finite Fields Appl"},{"issue":"1","key":"693_CR16","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10623-022-01106-3","volume":"91","author":"M Shi","year":"2022","unstructured":"Shi, M., Liu, N., Kim, J.-L., Sol\u00e9, P.: Additive complementary dual codes over $${\\mathbb{F} }_4$$. Designs Codes Cryptogr.\u00a091(1), 273\u2013284 (2022)","journal-title":"Designs Codes Cryptogr"},{"issue":"11","key":"693_CR17","doi-asserted-by":"publisher","first-page":"4892","DOI":"10.1109\/TIT.2006.883612","volume":"52","author":"A Ketkar","year":"2006","unstructured":"Ketkar, A., Klappenecker, A., Kumar, S., Sarvepalli, P.K.: Nonbinary stabilizer codes over finite fields. IEEE Trans. Inf. Theory 52(11), 4892\u20134914 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"693_CR18","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1109\/18.681315","volume":"44","author":"AR Calderbank","year":"1998","unstructured":"Calderbank, A.R., Rains, E.M., Shor, P.M., Sloane, N.J.: Quantum error correction via codes over GF (4). IEEE Trans. Inf. Theory 44(4), 1369\u20131387 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"693_CR19","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.-M., Qi, Y., Pellikaan, R.: Linear codes over $$\\mathbb{F} _q$$ are equivalent to LCD codes for $$q\\ge 3$$. IEEE Trans. Inf. Theory 64, 3010\u20133017 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"693_CR20","unstructured":"Boonniyom, K., Jitman, S.: Complementary dual subfield linear codes over finite fields. Thai Journal of Mathematics Special issue ICMSA2015 (2016)"},{"key":"693_CR21","doi-asserted-by":"publisher","first-page":"4023","DOI":"10.1007\/s12190-023-01914-3","volume":"69","author":"GK Verma","year":"2023","unstructured":"Verma, G.K., Agrawal, A., Sharma, R.K.: Construction methods for Galois LCD codes over finite fields. J. Appl. Math. Comput. 69, 4023\u20134043 (2023)","journal-title":"J. Appl. Math. Comput."},{"issue":"3\u20134","key":"693_CR22","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(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"693_CR23","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. Online available at http:\/\/www.codetables.de"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-025-00693-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-025-00693-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-025-00693-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T08:43:54Z","timestamp":1781167434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-025-00693-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,21]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["693"],"URL":"https:\/\/doi.org\/10.1007\/s00200-025-00693-7","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,21]]},"assertion":[{"value":"6 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 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 have no conflict of interest in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}