{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:47:40Z","timestamp":1761864460153,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T00:00:00Z","timestamp":1663286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T00:00:00Z","timestamp":1663286400000},"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":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s12190-022-01784-1","type":"journal-article","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T13:03:02Z","timestamp":1663333382000},"page":"1221-1238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["ACD codes over $${\\mathbb {Z}}_{2}{\\mathcal {R}}$$ and the MacWilliams identities"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0174-2447","authenticated-orcid":false,"given":"Vidya","family":"Sagar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8668-1948","authenticated-orcid":false,"given":"Ritumoni","family":"Sarma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,16]]},"reference":[{"issue":"9","key":"1784_CR1","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}[u]$$-additive codes. Int. J. Comput. Math. 92(9), 1806\u20131814 (2015)","journal-title":"Int. J. Comput. Math."},{"key":"1784_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2019.101622","volume":"62","author":"N Benbelkacem","year":"2020","unstructured":"Benbelkacem, N., Borges, J., Dougherty, S.T., Fern\u00e1ndez-C\u00f3rdoba, C.: On $${\\mathbb{Z} }_{2}{\\mathbb{Z} }_{4}$$-additive complementary dual codes and related LCD codes. Finite Fields Their Appl. 62, 101622 (2020)","journal-title":"Finite Fields Their Appl."},{"issue":"3\u20134","key":"1784_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. Symb. Comput. 24(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"issue":"1","key":"1784_CR4","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":"1784_CR5","doi-asserted-by":"crossref","unstructured":"Dougherty, S. T.: Algebraic Coding Theory over Finite Commutative Rings, Springer Briefs in Mathematics, Springer, (2017)","DOI":"10.1007\/978-3-319-59806-2"},{"issue":"2\u20133","key":"1784_CR6","first-page":"116","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(2\u20133), 116\u2013128 (2017)","journal-title":"Int. J. Inf. Coding Theory"},{"issue":"3","key":"1784_CR7","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.ffa.2009.01.002","volume":"15","author":"M Esmaeili","year":"2009","unstructured":"Esmaeili, M., Yari, S.: On complementary-dual quasi-cyclic codes. Finite Fields Their Appl. 15(3), 375\u2013386 (2009)","journal-title":"Finite Fields Their Appl."},{"issue":"4","key":"1784_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(4), 719\u2013728 (2018)","journal-title":"Cryptogr. Commun."},{"key":"1784_CR9","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes. http:\/\/www.codetables.de"},{"issue":"2","key":"1784_CR10","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"AR Hammons","year":"1994","unstructured":"Hammons, A.R., Kumar, P.V., Calderbank, A.R., Slone, N.J.A., Sol\u00e9, P.: The $${\\mathbb{Z} }_{4}$$ linearity of Kerdock, Preparata, Goethals and related codes. IEEE Trans. Inf. Theory 40(2), 301\u2013319 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1784_CR11","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(4), 677\u2013696 (2019)","journal-title":"Cryptogr. Commun."},{"issue":"6","key":"1784_CR12","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/PL00000451","volume":"76","author":"T Honold","year":"2001","unstructured":"Honold, T.: Characterization of finite Frobenius rings. Arch. Math. 76(6), 406\u2013415 (2001)","journal-title":"Arch. Math."},{"issue":"7","key":"1784_CR13","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":"1784_CR14","doi-asserted-by":"crossref","unstructured":"Lidl, R., Niederreiter, H.: Introduction to Finite Fields and their Applications, 2nd edn. Cambridge University Press (1994)","DOI":"10.1017\/CBO9781139172769"},{"key":"1784_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ffa.2015.01.004","volume":"34","author":"X Liu","year":"2015","unstructured":"Liu, X., Liu, H.: LCD codes over finite chain rings. Finite Fields Their Appl. 34, 1\u201319 (2015)","journal-title":"Finite Fields Their Appl."},{"issue":"1","key":"1784_CR16","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s12190-015-0918-2","volume":"51","author":"M Shi","year":"2016","unstructured":"Shi, M., Wang, D., Sol\u00e9, P.: Linear codes over $${\\mathbb{F} }_{3}+u{\\mathbb{F} }_{3}+u^{2}{\\mathbb{F} }_{3}$$: MacWilliams identities, optimal ternary codes from one-Lee weight codes and two-Lee weight codes. J. Appl. Math. Comput. 51(1), 527\u2013544 (2016)","journal-title":"J. Appl. Math. Comput."},{"key":"1784_CR17","unstructured":"MacWilliams, F.J.: Combinatorial problems of elementary group theory, Ph.D. thesis, Harvard University, (1961)"},{"issue":"1","key":"1784_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/j.1538-7305.1963.tb04003.x","volume":"42","author":"FJ MacWilliams","year":"1963","unstructured":"MacWilliams, F.J.: A theorem on the distribution of weights in a systematic Code. Bell Syst. Tech. J. 42(1), 79\u201394 (1963)","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"1784_CR19","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(3), 369\u2013380 (1964)","journal-title":"Inf. Control"},{"key":"1784_CR20","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. Discrete Math. 106 \u2013107, 337\u2013342 (1992)","journal-title":"Discrete Math."},{"key":"1784_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-021-00545-4","author":"M Shi","year":"2021","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. (2021). https:\/\/doi.org\/10.1007\/s12095-021-00545-4","journal-title":"Cryptogr. Commun."},{"issue":"1\u20133","key":"1784_CR22","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0024-3795(99)00125-1","volume":"295","author":"K Shiromoto","year":"1999","unstructured":"Shiromoto, K.: A basic exact sequence for the Lee and Euclidean weights of linear codes over $${\\mathbb{Z} }_{l}$$. Linear Algebra Appl. 295(1\u20133), 191\u2013200 (1999)","journal-title":"Linear Algebra Appl."},{"key":"1784_CR23","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.laa.2016.11.034","volume":"516","author":"Y Tang","year":"2017","unstructured":"Tang, Y., Zhu, S., Kai, X.: MacWilliams type identities on the Lee and Euclidean weights for linear codes over $${\\mathbb{Z} }_{l}$$. Linear Algebra Appl. 516, 82\u201392 (2017)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"1784_CR24","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1353\/ajm.1999.0024","volume":"121","author":"JA Wood","year":"1999","unstructured":"Wood, J.A.: Duality for modules over finite rings and applications to coding theory. Am. J. Math. 121(3), 555\u2013575 (1999)","journal-title":"Am. J. Math."},{"key":"1784_CR25","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ffa.2013.12.007","volume":"27","author":"B Yildiz","year":"2014","unstructured":"Yildiz, B., Karadeniz, S.: Linear codes over $${\\mathbb{Z} }_{4} + u{\\mathbb{Z} }_{4}$$: MacWilliams identities, projections, and formally self-dual codes. Finite Fields Their Appl. 27, 24\u201340 (2014)","journal-title":"Finite Fields Their Appl."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01784-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-022-01784-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01784-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T22:46:44Z","timestamp":1674859604000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-022-01784-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,16]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1784"],"URL":"https:\/\/doi.org\/10.1007\/s12190-022-01784-1","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2022,9,16]]},"assertion":[{"value":"10 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Both authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}