{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:48:28Z","timestamp":1757616508212,"version":"3.44.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"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":["AAECC"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s00200-024-00648-4","type":"journal-article","created":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T06:02:31Z","timestamp":1709013751000},"page":"943-958","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal constacyclic codes with minimum distance four"],"prefix":"10.1007","volume":"36","author":[{"given":"Yajing","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoshan","family":"Kai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhonghua","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"issue":"6","key":"648_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":"5","key":"648_CR2","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":"9","key":"648_CR3","doi-asserted-by":"publisher","first-page":"5898","DOI":"10.1109\/TIT.2013.2260795","volume":"59","author":"C Ding","year":"2013","unstructured":"Ding, C., Helleseth, T.: Optimal ternary cyclic codes from monomials. IEEE Trans. Inf. Theory 59(9), 5898\u20135904 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"648_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.ffa.2015.10.004","volume":"37","author":"C Fan","year":"2016","unstructured":"Fan, C., Li, N., Zhou, Z.: A class of optimal ternary cyclic codes and their duals. Finite Fields Appl. 37, 193\u2013202 (2016)","journal-title":"Finite Fields Appl."},{"key":"648_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ffa.2017.06.009","volume":"47","author":"W Fang","year":"2017","unstructured":"Fang, W., Wen, J., Fu, F.: A $$q$$ -polynomial approach to constacyclic codes. Finite Fields Appl. 47, 161\u2013182 (2017)","journal-title":"Finite Fields Appl."},{"key":"648_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.ffa.2019.07.002","volume":"59","author":"D Han","year":"2019","unstructured":"Han, D., Yan, H.: On an open problem about a class of optimal ternary cyclic codes. Finite Fields Appl. 59, 335\u2013343 (2019)","journal-title":"Finite Fields Appl."},{"key":"648_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge Univ. Press, Cambridge (2003)"},{"issue":"7","key":"648_CR8","doi-asserted-by":"publisher","first-page":"4344","DOI":"10.1109\/TIT.2017.2672961","volume":"63","author":"C Li","year":"2017","unstructured":"Li, C., Ding, C., Li, S.: LCD cyclic codes over finite fields. IEEE Trans. Inf. Theory 63(7), 4344\u20134356 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"648_CR9","doi-asserted-by":"publisher","first-page":"4710","DOI":"10.1109\/TIT.2014.2329694","volume":"60","author":"C Li","year":"2014","unstructured":"Li, C., Li, N., Helleseth, T., Ding, C.: The weight distributions of several classes of cyclic codes from APN monomials. IEEE Trans. Inf. Theory 60(8), 4710\u20134721 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"648_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ffa.2014.06.001","volume":"30","author":"N Li","year":"2014","unstructured":"Li, N., Li, C., Helleseth, T., Ding, C., Tang, X.: Optimal ternary cyclic codes with minimum distance four and five. Finite Fields Appl. 30, 100\u2013120 (2014)","journal-title":"Finite Fields Appl."},{"key":"648_CR11","doi-asserted-by":"crossref","unstructured":"Li, N., Zhou, Z., Helleseth, T.: On a conjecture about a class of optimal ternary cyclic codes. In: Signal Design and its Applications in Communications (IWSDA), 2015 Seventh Intertional Workshop on Signal (2015)","DOI":"10.1109\/IWSDA.2015.7458415"},{"issue":"8","key":"648_CR12","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/LCOMM.2019.2921330","volume":"23","author":"D Liao","year":"2019","unstructured":"Liao, D., Kai, X., Zhu, S., Li, P.: A class of optimal cyclic codes with two zeros. IEEE Commun. Lett. 23(8), 1293\u20131296 (2019)","journal-title":"IEEE Commun. Lett."},{"issue":"7","key":"648_CR13","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1109\/LCOMM.2020.2983373","volume":"24","author":"Y Liu","year":"2020","unstructured":"Liu, Y., Cao, X.: Four classes of optimal quinary cyclic codes. IEEE Commun. Lett. 24(7), 1387\u20131390 (2020)","journal-title":"IEEE Commun. Lett."},{"issue":"2","key":"648_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10623-019-00679-w","volume":"88","author":"Y Liu","year":"2020","unstructured":"Liu, Y., Cao, X., Lu, W.: On some conjectures about optimal ternary cyclic codes. Des. Codes Cryptogr. 88(2), 297\u2013309 (2020)","journal-title":"Des. Codes Cryptogr."},{"key":"648_CR15","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2021033","author":"Y Liu","year":"2021","unstructured":"Liu, Y., Cao, X., Lu, W.: Two classes of new optimal ternary cyclic codes. Adv. Math. Commun. (2021). https:\/\/doi.org\/10.3934\/amc.2021033","journal-title":"Adv. Math. Commun."},{"issue":"12","key":"648_CR16","doi-asserted-by":"publisher","first-page":"5345","DOI":"10.1109\/TIT.2008.2006394","volume":"54","author":"J Luo","year":"2008","unstructured":"Luo, J., Feng, K.: Cyclic codes and sequence from generalized Coulter\u2013Matthews function. IEEE Trans. Inf. Theory 54(12), 5345\u20135353 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"648_CR17","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ffa.2016.03.007","volume":"40","author":"L Wang","year":"2016","unstructured":"Wang, L., Wu, G.: Several classes of optimal ternary cyclic codes with minimum distance four. Finite Fields Appl. 40, 126\u2013137 (2016)","journal-title":"Finite Fields Appl."},{"issue":"4","key":"648_CR18","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s12095-015-0159-0","volume":"8","author":"G Xu","year":"2016","unstructured":"Xu, G., Cao, X., Xu, S.: Optimal $$p$$-ary cyclic codes with minimum distance four from monomials. Cryptogr. Commun. 8(4), 541\u2013554 (2016)","journal-title":"Cryptogr. Commun."},{"issue":"6","key":"648_CR19","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1587\/transfun.E102.A.849","volume":"102","author":"H Yan","year":"2019","unstructured":"Yan, H., Han, D.: New ternary power mapping with differential uniformity $$\\Delta _f \\le $$ 3 and related optimal cyclic codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102(6), 849\u2013853 (2019)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"648_CR20","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ffa.2018.08.004","volume":"54","author":"H Yan","year":"2018","unstructured":"Yan, H., Zhou, Z., Du, X.: A family of optimal ternary cyclic codes from the NIHO-type exponent. Finite Fields Appl. 54, 101\u2013112 (2018)","journal-title":"Finite Fields Appl."},{"key":"648_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2020.101671","volume":"64","author":"Z Zha","year":"2020","unstructured":"Zha, Z., Hu, L.: New classes of optimal ternary cyclic codes with minimum distance four. Finite Fields Appl. 64, 101671 (2020)","journal-title":"Finite Fields Appl."},{"key":"648_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2021.101898","volume":"75","author":"Z Zha","year":"2021","unstructured":"Zha, Z., Hu, L., Liu, Y., Cao, X.: Further results on optimal cyclic codes. Finite Fields Appl. 75, 101898 (2021)","journal-title":"Finite Fields Appl."},{"key":"648_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2022.101995","volume":"79","author":"H Zhao","year":"2022","unstructured":"Zhao, H., Luo, R., Sun, T.: Two families of optimal ternary cyclic codes with minimal distance four. Finite Fields Appl. 79, 101995 (2022)","journal-title":"Finite Fields Appl."},{"key":"648_CR24","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.ffa.2018.09.006","volume":"55","author":"Y Zhou","year":"2019","unstructured":"Zhou, Y., Kai, X., Zhu, S., Li, J.: On the minimum distance of negacyclic codes with two zeros. Finite Fields Appl. 55, 134\u2013150 (2019)","journal-title":"Finite Fields Appl."},{"key":"648_CR25","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ffa.2013.08.005","volume":"25","author":"Z Zhou","year":"2014","unstructured":"Zhou, Z., Ding, C.: A class of three-weight cyclic codes. Finite Fields Appl. 25, 79\u201393 (2014)","journal-title":"Finite Fields Appl."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-024-00648-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-024-00648-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-024-00648-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T19:18:02Z","timestamp":1757099882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-024-00648-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,27]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["648"],"URL":"https:\/\/doi.org\/10.1007\/s00200-024-00648-4","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"type":"print","value":"0938-1279"},{"type":"electronic","value":"1432-0622"}],"subject":[],"published":{"date-parts":[[2024,2,27]]},"assertion":[{"value":"27 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All the authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All the procedures performed in this study were in accordance with the ethical standards of the institutional and\/or national research committee and with the 1964 Helsinki Declaration and its later amendments or comparable ethical standards.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}