{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:50:30Z","timestamp":1761598230071,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T00:00:00Z","timestamp":1593388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T00:00:00Z","timestamp":1593388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61772015"],"award-info":[{"award-number":["61772015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s12190-020-01383-y","type":"journal-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T09:03:40Z","timestamp":1593421420000},"page":"107-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The minimum Hamming distances of repeated-root cyclic codes of length $$6p^s$$ and their MDS codes"],"prefix":"10.1007","volume":"65","author":[{"given":"Ying","family":"Gao","sequence":"first","affiliation":[]},{"given":"Qin","family":"Yue","sequence":"additional","affiliation":[]},{"given":"Fengwei","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,29]]},"reference":[{"issue":"6","key":"1383_CR1","doi-asserted-by":"publisher","first-page":"2089","DOI":"10.1109\/TIT.2005.847722","volume":"51","author":"C Carlet","year":"2005","unstructured":"Carlet, C., Ding, C., Yuan, J.: Linear codes from highly nonlinear functions and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089\u20132102 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1383_CR2","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(2), 337\u2013342 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1383_CR3","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/j.ffa.2012.10.001","volume":"18","author":"B Chen","year":"2012","unstructured":"Chen, B., Fan, Y., Lin, L., Liu, H.: Constacyclic codes over finitefields. Finite Fields Appl. 18(6), 1217\u20131231 (2012)","journal-title":"Finite Fields Appl."},{"key":"1383_CR4","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.dam.2014.05.046","volume":"177","author":"B Chen","year":"2014","unstructured":"Chen, B., Dinh, H.Q., Liu, H.: Repeated-root constacyclic codes of length $$lp^s$$ and their duals. Discrete Appl. Math. 177, 60\u201370 (2014)","journal-title":"Discrete Appl. Math."},{"key":"1383_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.ffa.2014.11.006","volume":"33","author":"B Chen","year":"2015","unstructured":"Chen, B., Dinh, H.Q., Liu, H.: Repeated-root constacyclic codes of length $$2l^mp^s$$. Finite Fields Appl. 33, 137\u2013159 (2015)","journal-title":"Finite Fields Appl."},{"issue":"12","key":"1383_CR6","doi-asserted-by":"publisher","first-page":"7661","DOI":"10.1109\/TIT.2017.2753250","volume":"62","author":"B Chen","year":"2017","unstructured":"Chen, B., Lin, L., Liu, H.: Constacyclic symbol-pair codes: lower bounds and optimal constructions. IEEE Trans. Inf. Theory 62(12), 7661\u20137666 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1383_CR7","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1109\/TIT.1975.1055435","volume":"21","author":"P Delsarte","year":"1975","unstructured":"Delsarte, P.: On subfield subcodes of modified Reed-Solomon codes. IEEE Trans. Inf. Theory 21(5), 575\u2013576 (1975)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1383_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2004.09.011","volume":"330","author":"C Ding","year":"2005","unstructured":"Ding, C., Wang, X.: A coding theory construction of new systematic authentication codes. Theor. Comput. Sci. 330(1), 81\u201399 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"1383_CR9","doi-asserted-by":"publisher","first-page":"3605","DOI":"10.1109\/TIT.2010.2048504","volume":"56","author":"C Ding","year":"2010","unstructured":"Ding, C., Yang, Y., Tang, X.: Optimal sets of frequency hopping sequences from linear cyclic codes. IEEE Trans. Inf. Theory 56(7), 3605\u20133612 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1383_CR10","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":"1383_CR11","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"},{"key":"1383_CR12","doi-asserted-by":"publisher","first-page":"940","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, 940\u2013950 (2012)","journal-title":"Finite Fields Appl."},{"key":"1383_CR13","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":"1383_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1090\/conm\/609\/12150","volume":"609","author":"HQ Dinh","year":"2014","unstructured":"Dinh, H.Q.: Structure of repeated-root cyclic codes and negacyclic codes of length $$6p^s$$ and their duals. Contemp. Math. 609, 69\u201387 (2014)","journal-title":"Contemp. Math."},{"issue":"5","key":"1383_CR15","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."},{"key":"1383_CR16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2976536","author":"HQ Dinh","year":"2020","unstructured":"Dinh, H.Q., Wang, X., Sirisrisakulchai, J.: On the Hamming distances of constacyclic codes of length $$5p^s$$. IEEE Access (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2976536","journal-title":"IEEE Access"},{"key":"1383_CR17","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.disc.2009.07.018","volume":"310","author":"X Kai","year":"2010","unstructured":"Kai, X., Zhu, S.: On the distance of cyclic codes of length $$2^e$$ over $$Z_4$$. Discrete Math. 310, 12\u201320 (2010)","journal-title":"Discrete Math."},{"key":"1383_CR18","doi-asserted-by":"publisher","DOI":"10.1142\/6400","volume-title":"Codes for Error Detection","author":"T Kl\u00f8ve","year":"2007","unstructured":"Kl\u00f8ve, T.: Codes for Error Detection. World Scientific, Singapore (2007)"},{"key":"1383_CR19","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ffa.2014.01.009","volume":"28","author":"C Li","year":"2014","unstructured":"Li, C., Yue, Q., Li, F.: Weight distributions of cyclic codes with respect to pairwise coprime order elements. Finite Fields Appl. 28, 94\u2013114 (2014)","journal-title":"Finite Fields Appl."},{"key":"1383_CR20","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.ffa.2016.08.005","volume":"42","author":"L Liu","year":"2016","unstructured":"Liu, L., Li, L., Kai, X., Zhu, S.: Repeated-root constacyclic codes of length $$3lp^n$$ and their dual codes. Finite Fields Appl. 42, 269\u2013295 (2016)","journal-title":"Finite Fields Appl."},{"key":"1383_CR21","first-page":"92","volume":"5527","author":"H \u00d6zadam","year":"2009","unstructured":"\u00d6zadam, H., \u00d6zbudak, F.: The minimum Hamming distance of cyclic codes of length $$2p^s$$. Appl. Algebra Eng. Commun. Comput. 5527, 92\u2013100 (2009)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"6","key":"1383_CR22","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/s13226-015-0158-z","volume":"46","author":"M Raka","year":"2015","unstructured":"Raka, M.: A class of constacyclic codes over a finite field-II. Indian J. Pure Appl. Math. 46(6), 809\u2013825 (2015)","journal-title":"Indian J. Pure Appl. Math."},{"key":"1383_CR23","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s12095-014-0106-5","volume":"7","author":"A Sharma","year":"2015","unstructured":"Sharma, A.: Repeated-root constacyclic codes of length $$l^tp^s$$ and their duals codes. Cryptogr. Commun. 7, 229\u2013255 (2015)","journal-title":"Cryptogr. Commun."},{"issue":"4","key":"1383_CR24","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s12095-015-0163-4","volume":"8","author":"A Sharma","year":"2016","unstructured":"Sharma, A., Rani, S.: On constacyclic codes over finite fields. Cryptogr. Commun. 8(4), 617\u2013636 (2016)","journal-title":"Cryptogr. Commun."},{"issue":"2","key":"1383_CR25","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. Inf. Theory 37(2), 343\u2013345 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1383_CR26","volume-title":"Introduction to Coding Theory","author":"JH Van Lint","year":"2003","unstructured":"Van Lint, J.H.: Introduction to Coding Theory. Springer, Berlin (2003)"},{"key":"1383_CR27","first-page":"844","volume":"338","author":"X Zhu","year":"2015","unstructured":"Zhu, X., Yue, Q., Hu, L.: Weight distributions of cyclic codes of length $$tl^m$$. Discrete Appl. Math. 338, 844\u2013856 (2015)","journal-title":"Discrete Appl. Math."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-020-01383-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-020-01383-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-020-01383-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T23:28:37Z","timestamp":1624922917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-020-01383-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,29]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["1383"],"URL":"https:\/\/doi.org\/10.1007\/s12190-020-01383-y","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2020,6,29]]},"assertion":[{"value":"6 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}