{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:10:28Z","timestamp":1766733028431,"version":"build-2065373602"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Natural Science Foundation of Fujian Province of China","award":["2022J05134"],"award-info":[{"award-number":["2022J05134"]}]},{"name":"Open Foundation of Hubei Key Laboratory of Applied Mathematics","award":["HBAM202305"],"award-info":[{"award-number":["HBAM202305"]}]},{"name":"Foundation of Yunnan Key Laboratory of Service Computing","award":["YNSC24113"],"award-info":[{"award-number":["YNSC24113"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272148, 72471206"],"award-info":[{"award-number":["62272148, 72471206"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100021171","name":"GuangDong Basic and Applied Basic Research Foundation","doi-asserted-by":"crossref","award":["2021A1515110605"],"award-info":[{"award-number":["2021A1515110605"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Dongguan Sci-tech Commissoner Program","award":["20221800500772"],"award-info":[{"award-number":["20221800500772"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s12095-025-00814-6","type":"journal-article","created":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T02:23:23Z","timestamp":1751509403000},"page":"1521-1542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Several classes of optimal quinary cyclic codes with minimum distance four"],"prefix":"10.1007","volume":"17","author":[{"given":"Qian","family":"Liu","sequence":"first","affiliation":[]},{"given":"Junhao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Dabin","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Liupiao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,3]]},"reference":[{"issue":"6","key":"814_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 perfect nonlinear mappings and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089\u20132102 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"814_CR2","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"},{"issue":"7","key":"814_CR3","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":"814_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":"814_CR5","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1049\/cje.2020.02.011","volume":"29","author":"J Fan","year":"2020","unstructured":"Fan, J., Zhang, Y.: Optimal quinary cyclic codes with minimum distance four. Chinese J. Electron. 29, 515\u2013524 (2020)","journal-title":"Chinese J. Electron."},{"key":"814_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":"814_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"W Huffman","year":"2003","unstructured":"Huffman, W., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"814_CR8","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":"814_CR9","doi-asserted-by":"crossref","unstructured":"Li, N., Zhou, Z., Helleseth, T.: On a conjecture about a class of optimal ternary cyclic codes. In: Seventh International Workshop on Signal Design and Its Applications in Communications, pp. 62\u201365 (2015)","DOI":"10.1109\/IWSDA.2015.7458415"},{"issue":"8","key":"814_CR10","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."},{"key":"814_CR11","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1997)"},{"key":"814_CR12","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, 1387\u20131390 (2020)","journal-title":"IEEE Commun. Lett."},{"key":"814_CR13","doi-asserted-by":"publisher","unstructured":"Liu, Y., Cao, X.: Three new classes of optimal quinary cyclic codes with minimum distance four. Appl. Algebra Eng. Commun. Comput. (2023). https:\/\/doi.org\/10.1007\/s00200-023-00621-7","DOI":"10.1007\/s00200-023-00621-7"},{"issue":"2","key":"814_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."},{"issue":"4","key":"814_CR15","doi-asserted-by":"publisher","first-page":"979","DOI":"10.3934\/amc.2021033","volume":"17","author":"Y Liu","year":"2023","unstructured":"Liu, Y., Cao, X., Lu, W.: Two classes of new optimal ternary cyclic codes. Adv. Math. Commun. 17(4), 979\u2013993 (2023)","journal-title":"Adv. Math. Commun."},{"key":"814_CR16","doi-asserted-by":"publisher","unstructured":"Liu, Y., Cao, X., Zha, Z.: More classes of optimal quinary cyclic codes of form $$\\cal{C} _{(1, e, s)}$$. Appl. Algebra Eng. Commun. Comput. (2023). https:\/\/doi.org\/10.1007\/s00200-023-00604-8","DOI":"10.1007\/s00200-023-00604-8"},{"key":"814_CR17","unstructured":"Liu, Q., Dong, X., Liu, X., Zou, J.: Further results on several classes of optimal ternary cyclic codes with minimum distance four (2023). https:\/\/eprint.iacr.org\/2023\/888"},{"issue":"4","key":"814_CR18","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s00200-020-00458-4","volume":"33","author":"Q Liu","year":"2022","unstructured":"Liu, Q., Liu, X.: On some conjectures about optimal ternary cyclic codes. Appl. Algebra Eng. Commun. Comput. 33(4), 419\u2013436 (2022)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"4","key":"814_CR19","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.3934\/amc.2022052","volume":"16","author":"L Wang","year":"2022","unstructured":"Wang, L., Li, N., Xu, L., Hu, Z., Zeng, X., Nie, L.: Several new classes of optimal ternary cyclic codes with minimum distance four. Adv. Math. Commun. 16(4), 1001\u20131010 (2022)","journal-title":"Adv. Math. Commun."},{"key":"814_CR20","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 minimal distance four. Finite Fields Appl. 40, 126\u2013137 (2016)","journal-title":"Finite Fields Appl."},{"key":"814_CR21","doi-asserted-by":"publisher","first-page":"102275","DOI":"10.1016\/j.ffa.2023.102275","volume":"92","author":"G Wu","year":"2023","unstructured":"Wu, G., Liu, H., Zhang, Y.: Several classes of optimal $$p$$-ary cyclic codes with minimum distance four. Finite Fields Appl. 92, 102275 (2023)","journal-title":"Finite Fields Appl."},{"key":"814_CR22","doi-asserted-by":"crossref","unstructured":"Wu, G., You, Z., Zha, Z., Zhang, Y.: Several new classes of optimal ternary cyclic codes with two or three zeros. (2024). arXiv:2407.07332v1","DOI":"10.1007\/s10623-024-01541-4"},{"key":"814_CR23","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s12095-024-00703-4","volume":"16","author":"T Wu","year":"2024","unstructured":"Wu, T., Zhu, S., Liu, L., Li, L.: Optimal quinary cyclic codes with three zeros. Cryptogr. Commun. 16, 801\u2013823 (2024)","journal-title":"Cryptogr. Commun."},{"issue":"4","key":"814_CR24","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."},{"key":"814_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2023.102284","volume":"92","author":"Z Ye","year":"2023","unstructured":"Ye, Z., Liao, Q.: On the Ding and Helleseth\u2019s 7th open problem about optimal ternary cyclic codes. Finite Fields Appl. 92, 102284 (2023)","journal-title":"Finite Fields Appl."},{"key":"814_CR26","doi-asserted-by":"publisher","first-page":"101671","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":"814_CR27","doi-asserted-by":"publisher","first-page":"101898","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 ternary cyclic codes. Finite Fields Appl. 75, 101898 (2021)","journal-title":"Finite Fields Appl."},{"key":"814_CR28","doi-asserted-by":"publisher","first-page":"101995","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."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-025-00814-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-025-00814-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-025-00814-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T11:46:17Z","timestamp":1760701577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-025-00814-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,3]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["814"],"URL":"https:\/\/doi.org\/10.1007\/s12095-025-00814-6","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2025,7,3]]},"assertion":[{"value":"5 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interests"}}]}}