{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:18:01Z","timestamp":1778851081439,"version":"3.51.4"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,10]],"date-time":"2021-01-10T00:00:00Z","timestamp":1610236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,10]],"date-time":"2021-01-10T00:00:00Z","timestamp":1610236800000},"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":[[2023,1]]},"DOI":"10.1007\/s00200-020-00474-4","type":"journal-article","created":{"date-parts":[[2021,1,10]],"date-time":"2021-01-10T15:03:34Z","timestamp":1610291014000},"page":"81-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the number of $${{\\mathbb {Z}}}_{2}{{\\mathbb {Z}}}_{4}$$ and $${{\\mathbb {Z}}}_{p}{{\\mathbb {Z}}}_{p^{2}}$$-additive cyclic codes"],"prefix":"10.1007","volume":"34","author":[{"given":"Eda","family":"Yildiz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taher","family":"Abualrub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ismail","family":"Aydogdu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,10]]},"reference":[{"issue":"3","key":"474_CR1","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1109\/TIT.2014.2299791","volume":"60","author":"T Abualrub","year":"2014","unstructured":"Abualrub, T., Siap, I., Aydin, N.: $${\\mathbb{Z}}_{2}{\\mathbb{Z}} _{4}$$-additive cyclic codes. IEEE Trans. Inf. Theory 60(3), 1508\u20131514 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"474_CR2","doi-asserted-by":"publisher","first-page":"4883","DOI":"10.1109\/TIT.2016.2632163","volume":"63","author":"I Aydogdu","year":"2017","unstructured":"Aydogdu, I., Abualrub, T., Siap, I.: $${\\mathbb{Z}}_{2} {\\mathbb{Z}}_{2}[u]$$-cyclic and constacyclic codes. IEEE Trans. Inf. Theory 63(8), 4883\u20134893 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"474_CR3","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.: $$\\mathbb{Z}_{2}\\mathbb{Z}_{4}$$-linear codes: generator matrices and duality. Des. Codes Cryptogr. 54(2), 167\u2013179 (2010)","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"474_CR4","doi-asserted-by":"publisher","first-page":"6348","DOI":"10.1109\/TIT.2016.2611528","volume":"62","author":"J Borges","year":"2016","unstructured":"Borges, J., Fern\u00e1ndez-C\u00f3rdoba, C., Ten-Valls, R.: $$\\mathbb{Z}_{2}\\mathbb{Z}_{4}$$-additive cyclic codes, generator polynomials and dual codes. IEEE Trans. Inf. Theory 62(11), 6348\u20136354 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"474_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.3934\/amc.2018011","volume":"12","author":"J Borges","year":"2018","unstructured":"Borges, J., Fern\u00e1ndez-C\u00f3rdoba, C., Ten-Valls, R.: On $$\\mathbb{Z}_{p^r}\\mathbb{Z}_{p^s}$$-additive cyclic codes. Adv. Math. Commun. 12(1), 169\u2013179 (2018)","journal-title":"Adv. Math. Commun."},{"key":"474_CR6","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1109\/18.681328","volume":"44","author":"C Carlet","year":"1998","unstructured":"Carlet, C.: $${\\mathbb{Z}}_{2^{k}}$$-linear codes. IEEE Trans. Inf. Theory 44, 1543\u20131547 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"474_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1090\/conm\/634\/12694","volume":"634","author":"S Dougherty","year":"2015","unstructured":"Dougherty, S., Salturk, E.: Counting additive $${\\mathbb{Z}} _{2}{\\mathbb{Z}}_{4}$$ codes. Contemp. Math. 634, 137\u2013147 (2015)","journal-title":"Contemp. Math."},{"issue":"7","key":"474_CR8","doi-asserted-by":"publisher","first-page":"2522","DOI":"10.1109\/18.796395","volume":"45","author":"M Greferath","year":"1999","unstructured":"Greferath, M., Schmidt, S.E.: Gray isometries for finite chain rings. IEEE Trans. Inf. Theory 45(7), 2522\u20132524 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"474_CR9","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., Sloane, 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"},{"key":"474_CR10","doi-asserted-by":"crossref","unstructured":"Honold, T., Landjev, I.: Linear codes over finite chain rings. In: In Optimal Codes and Related Topics, Sozopol, Bulgaria, pp. 116\u2013126 (1998)","DOI":"10.37236\/1489"},{"issue":"3","key":"474_CR11","doi-asserted-by":"publisher","first-page":"425","DOI":"10.3934\/amc.2011.5.425","volume":"5","author":"H Rif\u00e0-Pous","year":"2011","unstructured":"Rif\u00e0-Pous, H., Rif\u00e0, J., Ronquillo, L.: $${\\mathbb{Z}} _{2}{\\mathbb{Z}}_{4}$$-additive perfect codes in steganography. Adv. Math. Commun. 5(3), 425\u2013433 (2011)","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"474_CR12","first-page":"143","volume":"1","author":"I Siap","year":"2013","unstructured":"Siap, I., Aydogdu, I.: Counting the generator matrices of $${ \\mathbb{Z}}_{2}{\\mathbb{Z}}_{8}$$ codes. Math. Sci. Appl. E-Notes 1(2), 143\u2013149 (2013)","journal-title":"Math. Sci. Appl. E-Notes"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00474-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-020-00474-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00474-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T16:03:27Z","timestamp":1673453007000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-020-00474-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,10]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["474"],"URL":"https:\/\/doi.org\/10.1007\/s00200-020-00474-4","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,10]]},"assertion":[{"value":"1 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}