{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T16:31:32Z","timestamp":1688401892368},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2020,4,24]],"date-time":"2020-04-24T00:00:00Z","timestamp":1587686400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,24]],"date-time":"2020-04-24T00:00:00Z","timestamp":1587686400000},"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":["AAECC"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00200-020-00432-0","type":"journal-article","created":{"date-parts":[[2020,4,24]],"date-time":"2020-04-24T16:03:39Z","timestamp":1587744219000},"page":"291-305","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hamming distance of repeated-root constacyclic codes of length $$2p^s$$ over $${\\mathbb {F}}_{p^m}+u{\\mathbb {F}}_{p^m}$$"],"prefix":"10.1007","volume":"31","author":[{"given":"Hai Q.","family":"Dinh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Gaur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Indivar","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhay K.","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoj Kumar","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roengchai","family":"Tansuchat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,24]]},"reference":[{"key":"432_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.3934\/amc.2018016","volume":"12","author":"Y-L Cao","year":"2018","unstructured":"Cao, Y.-L., Cao, Y., Dinh, H.Q., Fu, F.-W., Gao, J., Sriboonchitta, S.: Constacyclic codes of length $$np^s$$ over $${\\mathbb{F}}_{p^m} + u{\\mathbb{F}}_{p^m}$$. Adv. Math. Commun. 12, 231\u2013262 (2018)","journal-title":"Adv. Math. Commun."},{"key":"432_CR2","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.ffa.2018.10.003","volume":"55","author":"Y-L Cao","year":"2019","unstructured":"Cao, Y.-L., Cao, Y., Dinh, H.Q., Fu, F.-W., Gao, J., Sriboonchitta, S.: A class of repeated-root constacyclic codes over $${\\mathbb{F}}_{p^m}[u]\/\\langle u^e \\rangle$$ of Type $$2$$. Finite Fields Appl. 55, 238\u2013267 (2019)","journal-title":"Finite Fields Appl."},{"key":"432_CR3","doi-asserted-by":"publisher","first-page":"2077","DOI":"10.1016\/j.disc.2019.04.008","volume":"342","author":"Y-L Cao","year":"2019","unstructured":"Cao, Y.-L., Cao, Y., Dinh, H.Q., Jitman, S.: An explicit representation and enumeration for self-dual cyclic codes over $${\\mathbb{F}}_{2^m}+u{\\mathbb{F}}_{2^m}$$ of length $$2^s$$. Discrete Math. 342, 2077\u20132091 (2019)","journal-title":"Discrete Math."},{"key":"432_CR4","first-page":"2050103.1-15","volume":"19","author":"Y-L Cao","year":"2020","unstructured":"Cao, Y.-L., Cao, Y., Dinh, H.Q., Fu, F.-W., Gao, J., Sriboonchitta, S.: A class of linear codes of length $$2$$ over finite chain rings. J. Algebra Appl. 19, 2050103.1-15 (2020)","journal-title":"J. Algebra Appl."},{"key":"432_CR5","doi-asserted-by":"crossref","unstructured":"Cao, Y.-L., Cao, Y., Dinh, H.Q., Fu, F.-W., Ma, F.: Construction and enumeration for self-dual cyclic codes of even length over $${\\mathbb{F}}_{2^m} + u{\\mathbb{F}}_{2^m}$$. Finite Fields Appl. 61, (2020). (in press)","DOI":"10.1016\/j.ffa.2019.101598"},{"key":"432_CR6","doi-asserted-by":"publisher","first-page":"111768","DOI":"10.1016\/j.disc.2019.111768","volume":"343","author":"Y-L Cao","year":"2020","unstructured":"Cao, Y.-L., Cao, Y., Dinh, H.Q., Fu, F.-W., Maneejuk, P.: On matrix-product structure of repeated-root constacyclic codes over finite fields. Discrete Math. 343, 111768 (2020). in press","journal-title":"Discrete Math."},{"key":"432_CR7","unstructured":"Cao, Y.-L., Cao, Y., Dinh, H.Q., Bandi, R., Fu, F.-W.: An explicit representation and enumeration for negacyclic codes of length $$2^kn$$ over $${\\mathbb{Z}}_4+u{\\mathbb{Z}}_4$$. Adv. Math. Commun. (2020). (in press)"},{"key":"432_CR8","doi-asserted-by":"publisher","first-page":"111868","DOI":"10.1016\/j.disc.2020.111868","volume":"343","author":"Y-L Cao","year":"2020","unstructured":"Cao, Y.-L., Cao, Y., Dinh, H.Q., Jitman, S.: An efficient method to construct self-dual cyclic codes of length $$p^s$$ over $${\\mathbb{F}}_{p^m} + u{\\mathbb{F}}_{p^m}$$. Discrete Math. 343, 111868 (2020). in press","journal-title":"Discrete Math."},{"key":"432_CR9","doi-asserted-by":"publisher","first-page":"55550","DOI":"10.1109\/ACCESS.2020.2981453","volume":"8","author":"Y-L Cao","year":"2020","unstructured":"Cao, Y.-L., Cao, Y., Dinh, H.Q., Bag, T., Yamaka, W.: Explicit representation and enumeration of repeated-root $$(\\delta +\\alpha u^2)$$-constacyclic codes over $${\\mathbb{F}}_{2^m}[u]\/\\langle u^{2\\lambda }\\rangle$$. IEEE Access 8, 55550\u201355562 (2020)","journal-title":"IEEE Access"},{"issue":"Issue C","key":"432_CR10","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 $$2p^s$$ over$${\\mathbb{F}}_{p^m}+u{\\mathbb{F}}_{p^m}$$. J. Finite Fields Appl. 37(Issue C), 108\u2013130 (2016)","journal-title":"J. Finite Fields Appl."},{"key":"432_CR11","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. Inf. Theory 37, 337\u2013342 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"432_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793557113500204","volume":"6","author":"HQ Dinh","year":"2013","unstructured":"Dinh, H.Q.: On repeated-root constacyclic codes of length $$4p^s$$. Asian Eur. J. Math. 6, 1\u201325 (2013)","journal-title":"Asian Eur. J. Math."},{"key":"432_CR13","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 $$2p^s$$. Finite Fields Appl. 18, 133\u2013143 (2012)","journal-title":"Finite Fields Appl."},{"key":"432_CR14","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/j.disc.2013.01.024","volume":"313","author":"HQ Dinh","year":"2013","unstructured":"Dinh, H.Q.: Structure of repeated-root constacyclic codes of length $$3p^s$$ and their duals. Discrete Math. 313, 983\u2013991 (2013)","journal-title":"Discrete Math."},{"key":"432_CR15","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ffa.2007.07.001","volume":"14","author":"HQ Dinh","year":"2008","unstructured":"Dinh, H.Q.: On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions. Finite Fields Appl. 14, 22\u201340 (2008)","journal-title":"Finite Fields Appl."},{"key":"432_CR16","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 $$p^s$$ over $${\\mathbb{F}}_{p^m}+u{\\mathbb{F}}_{p^m}$$. J. Algebra 324, 940\u2013950 (2010)","journal-title":"J. Algebra"},{"issue":"4","key":"432_CR17","doi-asserted-by":"publisher","first-page":"2417","DOI":"10.1109\/TIT.2017.2726691","volume":"64","author":"HQ Dinh","year":"2018","unstructured":"Dinh, H.Q., Nguyen, B.T., Singh, A.K., Sriboonchitta, S.: Hamming and symbol pair distances of repeated root constacycliccodes of prime power lengths over $${\\mathbb{F}}\\_{p^m} +u{\\mathbb{F}}\\_{p^m}$$. IEEE Trans. Inf. Theory 64(4), 2417\u20132430 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"432_CR18","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1016\/j.disc.2019.01.023","volume":"342","author":"HQ Dinh","year":"2019","unstructured":"Dinh, H.Q., Wang, X., Liu, H., Sriboonchitta, S.: On the Hamming distances of repeated-root constacyclic codes of length $$4p^s$$. Discrete Math. 342(5), 1456\u20131470 (2019)","journal-title":"Discrete Math."},{"issue":"4","key":"432_CR19","doi-asserted-by":"publisher","first-page":"2417","DOI":"10.1109\/TIT.2017.2726691","volume":"64","author":"HQ Dinh","year":"2018","unstructured":"Dinh, H.Q., Nguyen, B.T., Singh, A.K., Sriboonchitta, S.: On the symbol-pair distance of repeated-root constacyclic codes of prime power lengths. IEEE Trans. Inf. Theory 64(4), 2417\u20132430 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"432_CR20","doi-asserted-by":"publisher","DOI":"10.1142\/S0219498820502096","author":"HQ Dinh","year":"2019","unstructured":"Dinh, H.Q., Satpati, S., Singh, A.K., Yamaka, W.: Symbol-triple distance of repeated-root constacylic codes of prime power lengths. J. Algebra Appl. (2019). https:\/\/doi.org\/10.1142\/S0219498820502096","journal-title":"J. Algebra Appl."},{"key":"432_CR21","doi-asserted-by":"publisher","first-page":"145039","DOI":"10.1109\/ACCESS.2019.2944483","volume":"7","author":"HQ Dinh","year":"2019","unstructured":"Dinh, H.Q., Kumam, P., Kumar, P., Satpati, S., Singh, A.K., Yamaka, W.: MDS symbol-pair repeated-root constacylic codes of prime power lengths over $${\\mathbb{F}}_{p^m}+u{\\mathbb{F}}_{p^m}$$. IEEE Access 7, 145039\u2013145048 (2019)","journal-title":"IEEE Access"},{"key":"432_CR22","doi-asserted-by":"publisher","DOI":"10.1142\/S0219498820501510","author":"HQ Dinh","year":"2020","unstructured":"Dinh, H.Q., Wang, X., Sirisrisakulchai, J.: Optimal b-symbol constacyclic codes with respect to the singleton bound. J. Algebra Appl. (2020). https:\/\/doi.org\/10.1142\/S0219498820501510","journal-title":"J. Algebra Appl."},{"key":"432_CR23","doi-asserted-by":"publisher","first-page":"46242","DOI":"10.1109\/ACCESS.2020.2976536","volume":"8","author":"HQ Dinh","year":"2020","unstructured":"Dinh, H.Q., Wang, X., Sirisrisakulchai, J.: On the Hamming distance of constacyclic codes of length $$5p^s$$. IEEE Access 8, 46242\u201346254 (2020)","journal-title":"IEEE Access"},{"key":"432_CR24","doi-asserted-by":"publisher","first-page":"39946","DOI":"10.1109\/ACCESS.2020.2974866","volume":"8","author":"HQ Dinh","year":"2020","unstructured":"Dinh, H.Q., Wang, X., Maneejuk, P.: On the Hamming distance of repeated-root cyclic codes of length $$6p^s$$. IEEE Access 8, 39946\u201339958 (2020)","journal-title":"IEEE Access"},{"key":"432_CR25","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. Online available at http:\/\/www.codetables.de. Accessed 7 May 2019"},{"key":"432_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755279","volume-title":"Coding Theory\u2014A First Course","author":"S Ling","year":"2004","unstructured":"Ling, S., Xing, C.: Coding Theory\u2014A First Course. Cambridge Publications, Cambridge (2004)"},{"key":"432_CR27","doi-asserted-by":"crossref","unstructured":"Liu, Y., Shi, M., Dinh, H.Q., Sriboonchitta, S.: Repeated-root constacyclic codes of length $$3\\ell ^mp^s$$, Advances Math. Comm. (2019) (to appear)","DOI":"10.1007\/s40840-019-00787-9"},{"key":"432_CR28","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.ffa.2012.10.002","volume":"19","author":"SR Lopez-Permouth","year":"2013","unstructured":"Lopez-Permouth, S.R., Ozadam, H., Ozbudak, F., Szabo, S.: Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes. Finite Fields Appl. 19, 16\u201338 (2013)","journal-title":"Finite Fields Appl."},{"key":"432_CR29","first-page":"92","volume":"5527","author":"H Ozadam","year":"2009","unstructured":"Ozadam, H., Ozbudak, F.: The minimum hamming distance of cyclic codes of length $$2p^s$$. Appl. Algebra Eng. Commun. Comput. LNCS 5527, 92\u2013100 (2009)","journal-title":"Appl. Algebra Eng. Commun. Comput. LNCS"},{"key":"432_CR30","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":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00432-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-020-00432-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00432-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T05:03:54Z","timestamp":1619327034000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-020-00432-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,24]]},"references-count":30,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["432"],"URL":"https:\/\/doi.org\/10.1007\/s00200-020-00432-0","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,24]]},"assertion":[{"value":"8 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}