{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T20:36:10Z","timestamp":1775853370734,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T00:00:00Z","timestamp":1593216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T00:00:00Z","timestamp":1593216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2019R1I1A1A01060467"],"award-info":[{"award-number":["2019R1I1A1A01060467"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2019R1A6A1A11051177"],"award-info":[{"award-number":["2019R1A6A1A11051177"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2017R1A2B2004574"],"award-info":[{"award-number":["2017R1A2B2004574"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2016R1A5A1008055"],"award-info":[{"award-number":["2016R1A5A1008055"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10623-020-00776-1","type":"journal-article","created":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T15:08:11Z","timestamp":1593270491000},"page":"2247-2273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Classification of self-dual cyclic codes over the chain ring $$\\mathbb Z_p[u]\/\\langle u^3 \\rangle $$"],"prefix":"10.1007","volume":"88","author":[{"given":"Boran","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9510-3691","authenticated-orcid":false,"given":"Yoonjin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,27]]},"reference":[{"key":"776_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.B.: On the generator of $$\\mathbb{Z}_{4}$$ cyclic codes of length $$2^{e}$$. IEEE Trans. Inf. Theory 49, 2126\u20132133 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"776_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10623-006-9034-5","volume":"42","author":"T Abualrub","year":"2007","unstructured":"Abualrub T., Siap I.: Cyclic codes over the rings $$\\mathbb{Z}_2+u\\mathbb{Z}_2$$ and $$\\mathbb{Z}_2+u\\mathbb{Z}_2+u^2\\mathbb{Z}_2$$. Des. Codes Cryptogr. 42, 273\u2013287 (2007).","journal-title":"Des. Codes Cryptogr."},{"key":"776_CR3","first-page":"737","volume":"35","author":"M Al-Ashker","year":"2011","unstructured":"Al-Ashker M., Hamoudeh M.: Cyclic codes over $$\\mathbb{Z}_2+u\\mathbb{Z}_2+u^2\\mathbb{Z}_2+\\cdots +u^{k-1}\\mathbb{Z}_2$$. Turk. J. Math. 35, 737\u20137494 (2011).","journal-title":"Turk. J. Math."},{"key":"776_CR4","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1109\/18.761278","volume":"45","author":"A Bonnecaze","year":"1999","unstructured":"Bonnecaze A., Udaya P.: Cyclic codes and self-dual codes over $$\\mathbb{F}_2+u\\mathbb{F}_2$$. IEEE Trans. Inf. Theory 45, 1250\u20131255 (1999).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"776_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s00200-015-0281-4","volume":"27","author":"Y Cao","year":"2016","unstructured":"Cao Y., Fu F.-W.: Cyclic codes over $$\\mathbb{F}_{2^m}[u]\/\\langle u^k \\rangle $$ of oddly even length. Appl. Algebra Eng. Commun. Comput. 27, 259\u2013277 (2016).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"776_CR6","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s12095-016-0204-7","volume":"9","author":"Y Cao","year":"2017","unstructured":"Cao Y., Li Q.: Cyclic codes of odd length over $${\\mathbb{Z}}_4[u]\/\\langle u^k \\rangle $$. Cryptogr. Commun. 9, 599\u2013624 (2017).","journal-title":"Cryptogr. Commun."},{"key":"776_CR7","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.jalgebra.2010.05.027","volume":"5","author":"HQ Dinh","year":"2010","unstructured":"Dinh H.Q.: Constacyclic codes of length $$p^s$$ over $$\\mathbb{F}_{p^m}+u\\mathbb{F}_{p^m}$$. J. Algebra 5, 940\u2013950 (2010).","journal-title":"J. Algebra"},{"key":"776_CR8","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1016\/j.disc.2016.01.020","volume":"339","author":"HQ Dinh","year":"2016","unstructured":"Dinh H.Q., Dohmpongsa S., Sriboonchitta S.: Repeated-root constacyclic codes of prime power length over $$\\frac{{\\mathbb{F}}_{p^m}[u]}{\\langle u^a \\rangle }$$ and their duals. Discrete Math. 339, 1706\u20131715 (2016).","journal-title":"Discrete Math."},{"key":"776_CR9","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.disc.2017.08.044","volume":"341","author":"HQ Dinh","year":"2018","unstructured":"Dinh H.Q., Fan Y., Liu H., Liu X., Sriboonchitta S.: On self-dual constacyclic codes of length $$p^s$$ over $${\\mathbb{F}}_{p^m}+u{\\mathbb{F}}_{p^m}$$. Discrete Math. 341, 324\u2013335 (2018).","journal-title":"Discrete Math."},{"key":"776_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. Inf. Theory 50, 1728\u20131744 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"776_CR11","doi-asserted-by":"publisher","first-page":"2243","DOI":"10.1016\/j.disc.2018.04.028","volume":"341","author":"HQ Dinh","year":"2018","unstructured":"Dinh H.Q., Singh A.K., Kumar P., Sriboonchitta S.: On the structure of cyclic codes over the ring $${\\mathbb{Z}}_{2^s}[u]\/\\langle u^k \\rangle $$. Discrete Math. 341, 2243\u20132275 (2018).","journal-title":"Discrete Math."},{"key":"776_CR12","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 $$2p^s$$ over $${\\mathbb{F}}_{p^m}+u{\\mathbb{F}}_{p^m}$$. Finite Fields Appl. 31, 178\u2013201 (2015).","journal-title":"Finite Fields Appl."},{"key":"776_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10623-011-9539-4","volume":"63","author":"ST Dougherty","year":"2012","unstructured":"Dougherty S.T., Karadeniz S., Yildiz B.: Cyclic codes over $$R_k$$. Des. Codes Cryptogr. 63, 113\u2013126 (2012).","journal-title":"Des. Codes Cryptogr."},{"key":"776_CR14","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 and a nonlinear ternary $$(36, 3^{12}, 15)$$ code. IEEE Trans. Inf. Theory 45, 2522\u20132524 (1999).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"776_CR15","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"AR Hammons Jr","year":"1994","unstructured":"Hammons Jr. A.R., Kummar P.V., Calderbank A.R., Sloane N.J.A., Sole P.: The $${\\mathbb{Z}}_4$$ -linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory 40, 301\u2013319 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"776_CR16","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1016\/j.ffa.2008.02.003","volume":"14","author":"HM Kiah","year":"2008","unstructured":"Kiah H.M., Leung K.H., Ling S.: Cyclic codes over $$GR(p^2, m)$$ of length $$p^k$$. Finite Fields Appl. 14, 834\u2013846 (2008).","journal-title":"Finite Fields Appl."},{"key":"776_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10623-011-9538-5","volume":"63","author":"HM Kiah","year":"2012","unstructured":"Kiah H.M., Leung K.H., Ling S.: A note on cyclic codes over $$GR(p^2, m)$$ of length $$p^k$$. Des. Codes Cryptogr. 63, 105\u2013112 (2012).","journal-title":"Des. Codes Cryptogr."},{"key":"776_CR18","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-015-0137-8","volume":"81","author":"B Kim","year":"2016","unstructured":"Kim B., Lee Y.: Construction of extremal self-dual codes over $${\\mathbb{Z}}_8$$ and $${\\mathbb{Z}}_{16}$$. Des. Codes Cryptogr. 81, 239\u2013257 (2016).","journal-title":"Des. Codes Cryptogr."},{"key":"776_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ffa.2016.11.015","volume":"45","author":"B Kim","year":"2017","unstructured":"Kim B., Lee Y.: Lee weights of cyclic self-dual codes over Galois rings of characteristic $$p^2$$. Finite Fields Appl. 45, 107\u2013130 (2017).","journal-title":"Finite Fields Appl."},{"key":"776_CR20","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.ffa.2018.04.005","volume":"52","author":"B Kim","year":"2018","unstructured":"Kim B., Lee Y.: A mass formula for cyclic codes over Galois rings of characteristic $$p^3$$. Finite Fields Appl. 52, 214\u2013242 (2018).","journal-title":"Finite Fields Appl."},{"key":"776_CR21","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.ffa.2019.06.003","volume":"59","author":"B Kim","year":"2019","unstructured":"Kim B., Lee Y., Doo J.: Classification of cyclic codes over a non-Galois chain ring $${\\mathbb{Z}}_p[u]\/\\langle u^3 \\rangle $$. Finite Fields Appl. 59, 208\u2013237 (2019).","journal-title":"Finite Fields Appl."},{"key":"776_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-013-9843-2","volume":"74","author":"AK Singh","year":"2015","unstructured":"Singh A.K., Kewat P.K.: On cyclic codes over the ring $$\\mathbb{Z}_p[u]\/\\langle u^k \\rangle $$. Des. Codes Cryptogr. 74, 1\u201313 (2015).","journal-title":"Des. Codes Cryptogr."},{"key":"776_CR23","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ffa.2015.01.008","volume":"34","author":"R Sobhani","year":"2015","unstructured":"Sobhani R.: Complete classification of $$(\\delta +\\alpha u^2)$$ -constacyclic codes of length $$p^k$$ over $$\\mathbb{F}_{p^m}+u\\mathbb{F}_{p^m}+u^2\\mathbb{F}_{p^m}$$. Finite Fields Appl. 34, 123\u2013138 (2015).","journal-title":"Finite Fields Appl."},{"key":"776_CR24","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.ffa.2009.01.004","volume":"15","author":"R Sobhani","year":"2009","unstructured":"Sobhani R., Esmaeili M.: A note on cyclic codes over $$GR(p^2, m)$$ of length $$p^k$$. Finite Fields Appl. 15, 387\u2013391 (2009).","journal-title":"Finite Fields Appl."},{"key":"776_CR25","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1109\/18.930917","volume":"47","author":"J Wolfmann","year":"2001","unstructured":"Wolfmann J.: Binary images of cyclic codes over $${\\mathbb{Z}}_4$$. IEEE Trans. Inf. Theory 47, 1773\u20131779 (2001).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00776-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-020-00776-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00776-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T23:27:33Z","timestamp":1624750053000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-020-00776-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,27]]},"references-count":25,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["776"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00776-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,27]]},"assertion":[{"value":"9 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}