{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T16:02:22Z","timestamp":1771257742746,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T00:00:00Z","timestamp":1694476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T00:00:00Z","timestamp":1694476800000},"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,10]]},"DOI":"10.1007\/s12190-023-01915-2","type":"journal-article","created":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T19:01:51Z","timestamp":1694545311000},"page":"4045-4068","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Additive double polycyclic codes over $$\\mathbb {F}_{p^2}$$ and their applications to quantum codes"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3666-7635","authenticated-orcid":false,"given":"Mustafa","family":"Sar\u0131","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,12]]},"reference":[{"key":"1915_CR1","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.W., Sloane, N.J.A.: Quantum error correction via codes over $$\\mathbb{F} _4$$. IEEE Trans. Inform. Theory. 44, 1369\u20131387 (1998)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"1915_CR2","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. Inform. Theory. 52, 4892\u20134914 (2006)","journal-title":"IEEE Trans. Inform. Theory."},{"issue":"6","key":"1915_CR3","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.12785\/amis\/070617","volume":"7","author":"I Aydo\u011fdu","year":"2013","unstructured":"Aydo\u011fdu, I., Siap, I.: The structure of $$\\mathbb{Z} _2\\mathbb{Z} _{2^s}$$-additive codes: Bounds on the minimum distance. Appl. Math. Inf. Sci. 7(6), 2271\u20132278 (2013)","journal-title":"Appl. Math. Inf. Sci."},{"issue":"3","key":"1915_CR4","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., Ayd\u0131n, N.: $$\\mathbb{Z} _2\\mathbb{Z} _4$$-additive cyclic codes. IEEE Trans. Inform. Theory. 60(3), 1508\u20131513 (2014)","journal-title":"IEEE Trans. Inform. Theory."},{"issue":"10","key":"1915_CR5","doi-asserted-by":"crossref","first-page":"2089","DOI":"10.1080\/03081087.2014.952728","volume":"63","author":"I Aydo\u011fdu","year":"2015","unstructured":"Aydo\u011fdu, I., Siap, I.: On $$\\mathbb{Z} _{p^r}\\mathbb{Z} _{p^s}$$-additive codes. Linear Multilinear Algebra. 63(10), 2089\u20132102 (2015)","journal-title":"Linear Multilinear Algebra."},{"issue":"9","key":"1915_CR6","doi-asserted-by":"crossref","first-page":"1806","DOI":"10.1080\/00207160.2013.859854","volume":"92","author":"I Aydo\u011fdu","year":"2015","unstructured":"Aydo\u011fdu, 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."},{"issue":"11","key":"1915_CR7","doi-asserted-by":"publisher","first-page":"6348","DOI":"10.1109\/TIT.2016.2611528","volume":"62","author":"J Borges","year":"2016","unstructured":"Borges, J., Fernandez-C\u00f3rdoba, C., Ten-Valls, R.: $$\\mathbb{Z} _2\\mathbb{Z} _4$$-additive cyclic codes, generator polynomials, and dual codes. IEEE Trans. Inform. Theory. 62(11), 6348\u20136354 (2016)","journal-title":"IEEE Trans. Inform. Theory."},{"issue":"1","key":"1915_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.3934\/amc.2018011","volume":"12","author":"J Borges","year":"2018","unstructured":"Borges, J., Fernandez-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."},{"issue":"10","key":"1915_CR9","doi-asserted-by":"publisher","first-page":"1980","DOI":"10.1109\/LCOMM.2018.2863370","volume":"22","author":"M Shi","year":"2018","unstructured":"Shi, M., Wu, R., Sol\u00e9, P.: Asymptotically good additive cyclic codes exist. IEEE Commun. Lett. 22(10), 1980\u20131983 (2018)","journal-title":"IEEE Commun. Lett."},{"issue":"6","key":"1915_CR10","doi-asserted-by":"publisher","first-page":"3841","DOI":"10.1109\/TIT.2018.2883759","volume":"65","author":"M Shi","year":"2019","unstructured":"Shi, M., Wu, R., Krotov, D.S.: On $$Z_pZ_{p^k}$$-additive codes and their duality. IEEE Trans. Inform. Theory. 65(6), 3841\u20133847 (2019)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"1915_CR11","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s12190-018-01216-z","volume":"60","author":"I Aydo\u011fdu","year":"2019","unstructured":"Aydo\u011fdu, I., G\u00fcrsoy, F.: $$\\mathbb{Z} _2\\mathbb{Z} _4\\mathbb{Z} _8$$-cyclic codes. J. Appl. Math. Comput. 60, 327\u2013341 (2019)","journal-title":"J. Appl. Math. Comput."},{"key":"1915_CR12","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2022079","author":"R Molaei","year":"2022","unstructured":"Molaei, R., Khashyarmannesh, K.: $$\\mathbb{Z} _{p^r}\\mathbb{Z} _{p^s}\\mathbb{Z} _{p^t}$$-additive cyclic codes. Adv. Math. Commun. (2022). https:\/\/doi.org\/10.3934\/amc.2022079","journal-title":"Adv. Math. Commun."},{"issue":"11","key":"1915_CR13","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 cdoes. IEEE Trans. Inform. Theory. 67(11), 7232\u20137239 (2021)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"1915_CR14","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1007\/s10623-020-00799-8","volume":"88","author":"M Shi","year":"2020","unstructured":"Shi, M., Xu, L., Sol\u00e9, P.: Construction of isodual codes from polycirculant matrices. Des. Codes Cryptogr. 88, 2547\u20132560 (2020)","journal-title":"Des. Codes Cryptogr."},{"key":"1915_CR15","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1007\/s10623-021-00917-0","volume":"90","author":"R Wu","year":"2022","unstructured":"Wu, R., Shi, M.: On $$\\mathbb{Z} _2\\mathbb{Z} _4$$-additive polycyclic codes and their Gray images. Des. Codes Cryptogr. 90, 2551\u20132562 (2022)","journal-title":"Des. Codes Cryptogr."},{"key":"1915_CR16","doi-asserted-by":"publisher","first-page":"3491","DOI":"10.1007\/s12190-021-01669-9","volume":"68","author":"R Wu","year":"2022","unstructured":"Wu, R., Shi, M., Sol\u00e9, P.: On the structure of $$1$$-generator quasi-polycyclic codes over finite chain rings. J. Appl. Math. Comput. 68, 3491\u20133503 (2022)","journal-title":"J. Appl. Math. Comput."},{"key":"1915_CR17","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\u00e9, P.: Additive cyclic complementary dual codes over $$\\mathbb{F} _4$$. Finite Fields Appl. 83, 102087 (2022)","journal-title":"Finite Fields Appl."},{"key":"1915_CR18","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2022004","author":"AS Karbaski","year":"2022","unstructured":"Karbaski, A.S., Abualrub, T., Ayd\u0131n, N., Liu, P.: Additive polycyclic codes over $$\\mathbb{F} _4$$ induced by binary vectors and some optimal codes. Adv. Math. Commun. (2022). https:\/\/doi.org\/10.3934\/amc.2022004","journal-title":"Adv. Math. Commun."},{"key":"1915_CR19","unstructured":"Sar\u0131, M., K\u00f6ro\u011flu, M.E.: Additive polycyclic codes over $$\\mathbb{F} _{p^2}$$ for any prime $$p$$. In: Proceeding Book of $$2$$nd International Conference on Engineering, Natural and Social Sciences (ICENSOS 2023), 4\u20136 April, Konya, T\u00fcrkiye, 6\u20139 (2023)"},{"key":"1915_CR20","first-page":"1037","volume":"69","author":"HQ Dinh","year":"2023","unstructured":"Dinh, H.Q., Yadav, B.P., Pathak, S., Prasad, A., Upadhyay, A.K., Yamaka, W.: $${\\mathbb{F} _2}\\left[u \\right]{\\mathbb{F} _2}[u]$$-additive cyclic codes are asymptotically good. J. Appl. Math. Commun. 69, 1037\u20131056 (2023)","journal-title":"J. Appl. Math. Commun."},{"key":"1915_CR21","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes. http:\/\/www.codetables.de"},{"key":"1915_CR22","unstructured":"Grassl, M.: Bounds on the minimum distance of entanglement-assisted qutrit quantum codes. http:\/\/www.codetables.de\/EAQECC\/qutrit.php"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01915-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01915-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01915-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T14:03:51Z","timestamp":1695823431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01915-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,12]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1915"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01915-2","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,12]]},"assertion":[{"value":"23 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2023","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 interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}