{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T18:46:12Z","timestamp":1764701172824,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T00:00:00Z","timestamp":1724889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T00:00:00Z","timestamp":1724889600000},"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":["Cryptogr. Commun."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s12095-024-00741-y","type":"journal-article","created":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T07:02:44Z","timestamp":1724914964000},"page":"1593-1608","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Trace dual of additive cyclic codes over finite fields"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-7702","authenticated-orcid":false,"given":"Gyanendra K.","family":"Verma","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5666-4103","authenticated-orcid":false,"given":"R. K.","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,29]]},"reference":[{"key":"741_CR1","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1017\/S0004972722001344","volume":"107","author":"A Agrawal","year":"2022","unstructured":"Agrawal, A., Verma, G.K., Sharma, R.K.: Galois LCD codes over $$\\mathbb{F} _q+u\\mathbb{F} _q+v\\mathbb{F} _q+uv\\mathbb{F} _q$$. Bull. Aust. Math. Soc. 107, 330\u2013341 (2022)","journal-title":"Bull. Aust. Math. Soc."},{"issue":"7","key":"741_CR2","doi-asserted-by":"publisher","first-page":"3065","DOI":"10.1109\/18.959288","volume":"47","author":"A Ashikhmin","year":"2001","unstructured":"Ashikhmin, A., Knill, E.: Nonbinary quantum stabilizer codes. IEEE Trans. Inf. Theory. 47(7), 3065\u20133072 (2001)","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"2","key":"741_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s12095-015-0172-3","volume":"9","author":"RK Bandi","year":"2017","unstructured":"Bandi, R.K., Bhaintwal, M., Aydin, N.: A mass formula for negacyclic codes of length $${2^k}$$ and some good negacyclic codes over $$\\mathbb{Z} _4+u\\mathbb{ Z} _4$$. Cryptogr. Commun. 9(2), 241\u2013272 (2017)","journal-title":"Cryptogr. Commun."},{"key":"741_CR4","doi-asserted-by":"crossref","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3-4),235\u2013265 (1997). Computational algebra and number theory (London, 1993)","DOI":"10.1006\/jsco.1996.0125"},{"issue":"4","key":"741_CR5","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":"741_CR6","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":"741_CR7","doi-asserted-by":"publisher","first-page":"1728","DOI":"10.1109\/TIT.2004.831789","volume":"50","author":"HQ Dinh","year":"2004","unstructured":"Dinh, H.Q., L\u00f3pez-Permouth, S.R.: Cyclic and negacyclic codes over finite chain rings. IEEE Trans. Inf. Theory. 50, 1728\u20131744 (2004)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"741_CR8","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. Online available at"},{"issue":"3","key":"741_CR9","first-page":"249","volume":"1","author":"WC Huffman","year":"2010","unstructured":"Huffman, W.C.: Cyclic $$\\mathbb{F} _q$$-linear $$\\mathbb{F} _{q^t}$$-codes. Int. J. Inf. Coding Theory. 1(3), 249\u2013284 (2010)","journal-title":"Int. J. Inf. Coding Theory."},{"key":"741_CR10","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of error-correcting codes. (1975)"},{"key":"741_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112545","volume":"344","author":"H Islam","year":"2021","unstructured":"Islam, H., Mart\u2019inez-Moro, E., Prakash, O.: Cyclic codes over a non-chain ring $${R}_{e, q}$$ and their application to LCD codes. Discret. Math. 344, 112545 (2021)","journal-title":"Discret. Math."},{"issue":"1","key":"741_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s12095-021-00516-9","volume":"14","author":"H Islam","year":"2022","unstructured":"Islam, H., Prakash, O.: Construction of LCD and new quantum codes from cyclic codes over a finite non-chain ring. Cryptogr. Commun. 14(1), 59\u201373 (2022)","journal-title":"Cryptogr. Commun."},{"key":"741_CR13","doi-asserted-by":"publisher","first-page":"4892","DOI":"10.1109\/TIT.2006.883612","volume":"52","author":"A Ketkar","year":"2005","unstructured":"Ketkar, A., Klappenecker, A., Kumar, S., Sarvepalli, P.K.: Nonbinary stabilizer codes over finite fields. IEEE Trans. Inf. Theory. 52, 4892\u20134914 (2005)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"741_CR14","doi-asserted-by":"crossref","unstructured":"Ling, S., Xing, C.: Coding theory: a first course. Cambridge University Press. (2004)","DOI":"10.1017\/CBO9780511755279"},{"issue":"1","key":"741_CR15","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.ffa.2012.10.002","volume":"19","author":"SR L\u00f3pez-Permouth","year":"2013","unstructured":"L\u00f3pez-Permouth, S.R., \u00d6zadam, H., \u00d6zbudak, F., Szabo, S.: Polycyclic codes over galois rings with applications to repeated-root constacyclic codes. Finite Fields and Their Appli. 19(1), 16\u201338 (2013)","journal-title":"Finite Fields and Their Appli."},{"issue":"2","key":"741_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10623-012-9641-2","volume":"69","author":"E Mart\u00ednez-Moro","year":"2013","unstructured":"Mart\u00ednez-Moro, E., Pi\u00f1era-Nicol\u00e1s, A., R\u00faa, I.F.: Additive semisimple multivariable codes over. Des. Codes. Crypt. 69(2), 161\u2013180 (2013)","journal-title":"Des. Codes. Crypt."},{"key":"741_CR17","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."},{"issue":"5","key":"741_CR18","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1007\/s12095-022-00572-9","volume":"14","author":"S Patel","year":"2022","unstructured":"Patel, S., Prakash, O., Islam, H.: Cyclic codes over $${M_4 (\\mathbb{F} _2+u\\mathbb{F} _2)}$$. Cryptogr. Commun. 14(5), 1021\u20131034 (2022)","journal-title":"Cryptogr. Commun."},{"key":"741_CR19","doi-asserted-by":"crossref","unstructured":"Prakash, O., Yadav, S., Islam, H., Sol\u00e9, P.: Self-dual and LCD double circulant codes over a class of non-local rings. Comput Appl Math. 41 (2022)","DOI":"10.1007\/s40314-022-01947-7"},{"issue":"1","key":"741_CR20","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10623-022-01106-3","volume":"91","author":"M Shi","year":"2023","unstructured":"Shi, M., Liu, N., Kim, J.L., Sol\u00e9, P.: Additive complementary dual codes over $${\\mathbb{F} _4}$$. Des. Codes. Crypt. 91(1), 273\u2013284 (2023)","journal-title":"Des. Codes. Crypt."},{"key":"741_CR21","doi-asserted-by":"crossref","unstructured":"Shi, M., Liu, N., \u00d6zbudak, F., Sol\u00e9, P.: Additive cyclic complementary dual codes over $${\\mathbb{F}_4}$$. Finite Fields Appl. 83,Paper No. 102087, 22, (2022)","DOI":"10.1016\/j.ffa.2022.102087"},{"key":"741_CR22","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."},{"key":"741_CR23","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0012-365X(94)90283-6","volume":"126","author":"XH Yang","year":"1994","unstructured":"Yang, X.H., Massey, J.L.: The condition for a cyclic code to have a complementary dual. Discret. Math. 126, 391\u2013393 (1994)","journal-title":"Discret. Math."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00741-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00741-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00741-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T16:19:53Z","timestamp":1737476393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00741-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,29]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["741"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00741-y","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2024,8,29]]},"assertion":[{"value":"21 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2024","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 declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}