{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:15:50Z","timestamp":1775081750693,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T00:00:00Z","timestamp":1734566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T00:00:00Z","timestamp":1734566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Open Fund of Advanced Cryptography and System Security Key Laboratory of Sichuan Province","award":["SKLACSS-202205"],"award-info":[{"award-number":["SKLACSS-202205"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62072222 and 12461103"],"award-info":[{"award-number":["62072222 and 12461103"]}],"id":[{"id":"10.13039\/501100001809","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":[[2025,3]]},"DOI":"10.1007\/s10623-024-01541-4","type":"journal-article","created":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T15:54:48Z","timestamp":1734623688000},"page":"769-786","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Several new classes of optimal ternary cyclic codes with two or three zeros"],"prefix":"10.1007","volume":"93","author":[{"given":"Gaofei","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuohui","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengbang","family":"Zha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuqing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,19]]},"reference":[{"issue":"6","key":"1541_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":"12","key":"1541_CR2","doi-asserted-by":"publisher","first-page":"7940","DOI":"10.1109\/TIT.2013.2281205","volume":"59","author":"C Ding","year":"2013","unstructured":"Ding C., Gao Y., Zhou Z.: Five families of three-weight ternary cyclic codes and their duals. IEEE Trans. Inf. Theory 59(12), 7940\u20137946 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1541_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":"1541_CR4","doi-asserted-by":"crossref","unstructured":"El\u00a0Rouayheb S.Y., Georghiades C.N., Soljanin E., Sprintson A.: Bounds on codes based on graph theory. In: 2007 IEEE International Symposium on Information Theory, pp. 1876\u20131879 (2007).","DOI":"10.1109\/ISIT.2007.4557151"},{"key":"1541_CR5","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":"1541_CR6","doi-asserted-by":"publisher","first-page":"72290","DOI":"10.1109\/ACCESS.2022.3188696","volume":"10","author":"J Fan","year":"2022","unstructured":"Fan J., Wang B.: Two families of optimal ternary cyclic codes with two zeros. IEEE Access 10, 72290\u201372300 (2022).","journal-title":"IEEE Access"},{"key":"1541_CR7","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."},{"issue":"7","key":"1541_CR8","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1587\/transfun.2023EAL2055","volume":"107","author":"C He","year":"2024","unstructured":"He C., Ran X., Luo R.: Two classes of optimal ternary cyclic codes with minimum distance four. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(7), 1049\u20131052 (2024).","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"4","key":"1541_CR9","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1049\/cje.2019.04.001","volume":"28","author":"L Li","year":"2019","unstructured":"Li L., Zhu S., Liu L.: Three classes of optimal ternary cyclic codes and the weight distributions of their duals. Chin. J. Electron. 28(4), 674\u2013681 (2019).","journal-title":"Chin. J. Electron."},{"key":"1541_CR10","doi-asserted-by":"publisher","unstructured":"Li L., Liu L.: Some results on optimal ternary cyclic codes with minimal distance four. Chin. J. Electron. https:\/\/doi.org\/10.23919\/cje.2022.00.317.","DOI":"10.23919\/cje.2022.00.317"},{"key":"1541_CR11","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":"1541_CR12","doi-asserted-by":"crossref","unstructured":"Li N., Zhou Z., Helleseth T.: On a conjecture about a class of optimal ternary cyclic codes. In: 2015 Seventh International Workshop on Signal Design and Its Applications in Communications (IWSDA), pp. 62\u201365 (2015).","DOI":"10.1109\/IWSDA.2015.7458415"},{"key":"1541_CR13","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H.: Finite Fields, 2nd edn Cambridge University Press, Cambridge (1997).","edition":"2"},{"issue":"4","key":"1541_CR14","doi-asserted-by":"publisher","first-page":"979","DOI":"10.3934\/amc.2021033","volume":"17","author":"Y Liu","year":"2021","unstructured":"Liu Y., Cao X., Lu W.: Two classes of new optimal ternary cyclic codes. Adv. Math. Commun. 17(4), 979\u2013993 (2021).","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"1541_CR15","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":"11","key":"1541_CR16","doi-asserted-by":"publisher","first-page":"764","DOI":"10.4236\/am.2023.1411046","volume":"14","author":"W Qiu","year":"2023","unstructured":"Qiu W.: A class of new optimal ternary cyclic codes over $${\\mathbb{F} }_{3^m}$$ with minimum distance 4. Appl. Math. 14(11), 764\u2013772 (2023).","journal-title":"Appl. Math."},{"issue":"4","key":"1541_CR17","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":"1541_CR18","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":"1541_CR19","doi-asserted-by":"publisher","unstructured":"Wu T., Liu L., Li L.: Several classes of optimal cyclic codes with three zeros. Appl. Algebra Eng. Commun. Comput. https:\/\/doi.org\/10.1007\/s00200-023-00636-0.","DOI":"10.1007\/s00200-023-00636-0"},{"key":"1541_CR20","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, 541\u2013554 (2016).","journal-title":"Cryptogr. Commun."},{"key":"1541_CR21","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."},{"issue":"6","key":"1541_CR22","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":"1541_CR23","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":"1541_CR24","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":"1541_CR25","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 ternary cyclic codes. Finite Fields Appl. 75, 101898 (2021).","journal-title":"Finite Fields Appl."},{"key":"1541_CR26","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."},{"issue":"10","key":"1541_CR27","doi-asserted-by":"publisher","first-page":"4120","DOI":"10.1109\/TCOMM.2013.072213.130107","volume":"61","author":"Z Zhou","year":"2013","unstructured":"Zhou Z., Ding C.: Seven classes of three-weight cyclic codes. IEEE Trans. Commun. 61(10), 4120\u20134126 (2013).","journal-title":"IEEE Trans. Commun."},{"key":"1541_CR28","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":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01541-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01541-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01541-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T16:40:56Z","timestamp":1742229656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01541-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,19]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["1541"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01541-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,19]]},"assertion":[{"value":"23 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 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":"I declare that the authors have no conflict of interest as defined by Springer, or other interests that might be perceived to influence the results and\/or discussion reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors gave their consent for publication.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}}]}}