{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T08:24:41Z","timestamp":1765268681636},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T00:00:00Z","timestamp":1596931200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T00:00:00Z","timestamp":1596931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s12095-020-00450-2","type":"journal-article","created":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T01:02:41Z","timestamp":1596934961000},"page":"27-52","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Repeated-root constacyclic codes of length 2ps over $\\mathbb {F}_{p^{m}}+u\\mathbb {F}_{p^{m}}+u^{2}\\mathbb {F}_{p^{m}}$"],"prefix":"10.1007","volume":"13","author":[{"given":"Wateekorn","family":"Sriwirach","sequence":"first","affiliation":[]},{"given":"Chakkrid","family":"Klin-eam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,9]]},"reference":[{"key":"450_CR1","doi-asserted-by":"publisher","first-page":"2126","DOI":"10.1109\/TIT.2003.815763","volume":"49","author":"T Abualrub","year":"2003","unstructured":"Abualrub, T., Oehmke, R.: On the generators of $\\mathbb {Z},_{4}$ cyclic codes of length 2e. IEEE Trans. Inform. Theory 49, 2126\u20132133 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"450_CR2","first-page":"21","volume":"3","author":"SD Berman","year":"1967","unstructured":"Berman, S. D.: Semisimple cyclic and Abelian codes. II, Kibernetika (Kiev) 3, 21\u201330 (1967). (Russian). English translation: Cybernetics 3, 17\u201323 (1967)","journal-title":"II, Kibernetika (Kiev)"},{"key":"450_CR3","doi-asserted-by":"crossref","unstructured":"Blackford, T.: Cyclic Codes over $\\mathbb {Z}_{4}$ of Oddly Even Length. In: International Workshop on Coding and Cryptography, WCC 2001, Paris, Appl. Discrete Math. 128, 27\u201346 (2003)","DOI":"10.1016\/S0166-218X(02)00434-1"},{"key":"450_CR4","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.ffa.2015.09.006","volume":"37","author":"B Chen","year":"2016","unstructured":"Chen, B., Dinh, H. Q., Liu, H., Wang, L.: Constacyclic codes of length 2ps over $\\mathbb {F}_{p^{m}} + u\\mathbb {F}_{p^{m}}$. Finite Fields Appl. 37, 108\u2013130 (2016)","journal-title":"Finite Fields Appl."},{"key":"450_CR5","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1090\/S0273-0979-1993-00426-9","volume":"29","author":"AR Calderbank","year":"1993","unstructured":"Calderbank, A. R., Hammons, A. R., Kumar, P. V., Sloane, N. J. A., Sol\u00e9, P.: A linear construction for certain Kerdock and Preparata codes. Bull. AMS 29, 218\u2013222 (1993)","journal-title":"Bull. AMS"},{"key":"450_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/18.75249","volume":"37","author":"G Castagnoli","year":"1991","unstructured":"Castagnoli, G., Massey, J. L., Schoeller, P. A., von Seemann, N.: On repeated-root cyclic codes. IEEE Trans. Inform. Theory 37, 337\u2013342 (1991)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"450_CR7","doi-asserted-by":"publisher","first-page":"1730","DOI":"10.1109\/TIT.2009.2013015","volume":"55","author":"HQ Dinh","year":"2009","unstructured":"Dinh, H. Q.: Constacyclic codes of length 2s over Galois extension rings of $\\mathbb {F}_{2} + u\\mathbb {F}_{2}$. IEEE Trans. Inform. Theory 55, 1730\u20131740 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"450_CR8","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.jalgebra.2010.05.027","volume":"324","author":"HQ Dinh","year":"2010","unstructured":"Dinh, H. Q.: Constacyclic codes of length ps over $\\mathbb {F}_{p^{m}} + u\\mathbb {F}_{p^{m}}$. J. Algebra 324, 940\u2013950 (2010)","journal-title":"J. Algebra"},{"key":"450_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ffa.2011.07.003","volume":"18","author":"HQ Dinh","year":"2012","unstructured":"Dinh, H. Q.: Repeated-root constacyclic codes of length 2ps. Finite Fields Appl. 18, 133\u2013143 (2012)","journal-title":"Finite Fields Appl."},{"key":"450_CR10","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. Inform. Theory 50, 1728\u20131744 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"450_CR11","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ffa.2014.09.003","volume":"31","author":"HQ Dinh","year":"2015","unstructured":"Dinh, H. Q., Wang, L., Zhu, S.: Negacyclic codes of length 2ps over $\\mathbb {F}_{p^{m}} + u\\mathbb {F}_{p^{m}}$. Fin. Fields Appl. 31, 178\u2013201 (2015)","journal-title":"Fin. Fields Appl."},{"key":"450_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10623-005-2773-x","volume":"39","author":"ST Dougherty","year":"2006","unstructured":"Dougherty, S. T., Ling, S.: Cyclic codes over $\\mathbb {Z}_{4}$ of even length. Des. Codes Cryptogr. 39, 127\u2013153 (2006)","journal-title":"Des. Codes Cryptogr."},{"key":"450_CR13","first-page":"326","volume":"28","author":"G Falkner","year":"1979","unstructured":"Falkner, G., Kowol, B., Heise, W., Zehendner, E.: On the existence of cyclic optimal codes. Atti. Sem. Mat. Fis. Univ. Modena 28, 326\u2013341 (1979)","journal-title":"Atti. Sem. Mat. Fis. Univ. Modena"},{"key":"450_CR14","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. Inform. Theory 40, 301\u2013319 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"450_CR15","doi-asserted-by":"crossref","unstructured":"Huffman, W. C., Pless, V.: Fundamentals of Error-Correcting codes. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511807077"},{"issue":"4","key":"450_CR16","doi-asserted-by":"publisher","first-page":"853","DOI":"10.4134\/JKMS.2014.51.4.853","volume":"51","author":"X Liu","year":"2014","unstructured":"Liu, X., Xu, X.: Some classes of repeated-root constacyclic codes over $\\mathbb {F}_{p^{m}} + u\\mathbb {F}_{p^{m}} + u^{2}\\mathbb {F}_{p^{m}}$. J. Korean Math. Soc. 51(4), 853\u2013866 (2014)","journal-title":"J. Korean Math. Soc."},{"key":"450_CR17","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1998","unstructured":"MacWilliams, F. J., Sloane, N. J. A.: The Theory of Error-Correcting Codes. 10Th Impression, North-Holland (1998)"},{"key":"450_CR18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/TIT.1973.1054936","volume":"19","author":"JL Massey","year":"1973","unstructured":"Massey, J. L., Costello, D. J., Justesen, J.: Polynomial weights and code constructions. IEEE Trans. Inform. Theory 19, 101\u2013110 (1973)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"450_CR19","first-page":"123","volume":"1","author":"AA Nechaev","year":"1989","unstructured":"Nechaev, A. A.: Kerdock code in a cyclic form. Diskr. Math. (USSR) 1, 123\u2013139 (1989). (in Russian). English translation: Discrete Math. Appl. 1, 365\u2013384 (1991)","journal-title":"Diskr. Math. (USSR)"},{"key":"450_CR20","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.1109\/TIT.2003.811921","volume":"49","author":"C-S Nedeloaia","year":"2003","unstructured":"Nedeloaia, C. -S.: Weight distributions of cyclic self-dual codes. IEEE Trans. Inform. Theory 49, 1582\u20131591 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"450_CR21","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/PL00012382","volume":"10","author":"G Norton","year":"2000","unstructured":"Norton, G., S\u0103l\u0103gean-Mandache, A.: On the structure of linear cyclic codes over finite chain rings. Appl. Algebra Engrg. Comm. Comput. 10, 489\u2013506 (2000)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"450_CR22","volume-title":"Handbook of Coding Theory","author":"V Pless","year":"1998","unstructured":"Pless, V., Huffman, W. C.: Handbook of Coding Theory. Elsevier, Amsterdam (1998)"},{"key":"450_CR23","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.dam.2005.03.016","volume":"154","author":"A S\u0103l\u0103gean","year":"2006","unstructured":"S\u0103l\u0103gean, A.: Repeated-root cyclic and negacyclic codes over finite chain rings. Discret. Appl. Math. 154, 413\u2013419 (2006)","journal-title":"Discret. Appl. Math."},{"key":"450_CR24","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TIT.1986.1057151","volume":"32","author":"RM Roth","year":"1986","unstructured":"Roth, R. M., Seroussi, G.: On cyclic MDS codes of length q over GF(q). IEEE Trans. Inform. Theory 32, 284\u2013285 (1986)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"450_CR25","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1109\/18.556131","volume":"43","author":"L-z Tang","year":"1997","unstructured":"Tang, L.-z., Soh, C.B., Gunawan, E.: A note on the q-ary image of a qm-ary repeated-root cyclic code. IEEE Trans. Inform. Theory 43, 732\u2013737 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"450_CR26","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/18.75250","volume":"37","author":"JH van Lint","year":"1991","unstructured":"van Lint, J. H.: Repeated-root cyclic codes. IEEE Trans. Inform. Theory 37, 343\u2013345 (1991)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-020-00450-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-020-00450-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-020-00450-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,8]],"date-time":"2021-08-08T23:37:38Z","timestamp":1628465858000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-020-00450-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,9]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["450"],"URL":"https:\/\/doi.org\/10.1007\/s12095-020-00450-2","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,9]]},"assertion":[{"value":"24 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}