{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:46:30Z","timestamp":1757310390335,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T00:00:00Z","timestamp":1685145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T00:00:00Z","timestamp":1685145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972126","U21A20428","12171134","12271137"],"award-info":[{"award-number":["61972126","U21A20428","12171134","12271137"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002093"],"award-info":[{"award-number":["62002093"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s12190-023-01876-6","type":"journal-article","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T11:02:13Z","timestamp":1685185333000},"page":"3231-3243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A family of cyclic codes with two zeros"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3359-0014","authenticated-orcid":false,"given":"Yunfei","family":"Su","sequence":"first","affiliation":[]},{"given":"Xiaoshan","family":"Kai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"issue":"1\u20132","key":"1876_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s12190-020-01344-5","volume":"64","author":"T Abualrub","year":"2020","unstructured":"Abualrub, T., Aydin, N., Aydogdu, I.: Optimal binary codes derived from $$\\mathbb{F} _{2}\\mathbb{F} _{4}$$-additive cyclic codes. J. Appl. Math. Comput. 64(1\u20132), 71\u201387 (2020)","journal-title":"J. Appl. Math. Comput."},{"issue":"6","key":"1876_CR2","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":"4","key":"1876_CR3","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1109\/TIT.1964.1053699","volume":"10","author":"R Chien","year":"1964","unstructured":"Chien, R.: Cyclic decoding procedure for Bose-Chaudhuri-Hocquenghem codes. IEEE Trans. Inf. Theory 10(4), 357\u2013363 (1964)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1876_CR4","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":"5","key":"1876_CR5","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":"4","key":"1876_CR6","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/TIT.1965.1053825","volume":"11","author":"G Forney","year":"1965","unstructured":"Forney, G.: On decoding BCH codes. IEEE Trans. Inf. Theory 11(4), 549\u2013557 (1965)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1876_CR7","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. Online available at http:\/\/www.codetables.de. Accessed 3 Jan 2023"},{"issue":"9","key":"1876_CR8","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 a open problem about a class of optimal ternary cyclic codes. Finite Fields Appl. 59(9), 335\u2013343 (2019)","journal-title":"Finite Fields Appl."},{"key":"1876_CR9","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)"},{"issue":"8","key":"1876_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."},{"issue":"12","key":"1876_CR11","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 sequences from generalized Coulter-Matthews function. IEEE Trans. Inf. Theory 54(12), 5345\u20135353 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1876_CR12","doi-asserted-by":"publisher","first-page":"5332","DOI":"10.1109\/TIT.2008.2006424","volume":"54","author":"J Luo","year":"2008","unstructured":"Luo, J., Feng, K.: On the weight distributions of two classes of cyclic codes. IEEE Trans. Inf. Theory 54(12), 5332\u20135344 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1876_CR13","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(11), 100\u2013120 (2014)","journal-title":"Finite Fields Appl."},{"key":"1876_CR14","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 (IWSDA), IEEE, pp. 62\u201365 (2015)","DOI":"10.1109\/IWSDA.2015.7458415"},{"issue":"7","key":"1876_CR15","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":"1","key":"1876_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s00200-021-00489-5","volume":"34","author":"Y Liu","year":"2023","unstructured":"Liu, Y., Cao, X.: Optimal $$p$$-ary cyclic codes with two zeros. Appl. Algebr. Eng. Comm. 34(1), 129\u2013138 (2023)","journal-title":"Appl. Algebr. Eng. Comm."},{"key":"1876_CR17","doi-asserted-by":"publisher","unstructured":"Liu, Y., Cao, X., Lu, W.: Two classes of new optimal ternary cyclic codes. Adv. Math. Commun. https:\/\/doi.org\/10.3934\/amc.2021033","DOI":"10.3934\/amc.2021033"},{"issue":"2","key":"1876_CR18","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1016\/j.disc.2017.09.003","volume":"341","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Shi, M., Sol\u00e9, P.: Two-weight and three-weight codes from trace codes over $$\\mathbb{F} _p + u\\mathbb{F} _p + v\\mathbb{F} _p + uv\\mathbb{F} _p$$. Discrete Math. 341(2), 350\u2013357 (2018)","journal-title":"Discrete Math."},{"issue":"5","key":"1876_CR19","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s12190-017-1118-z","volume":"56","author":"B Pang","year":"2018","unstructured":"Pang, B., Zhu, S., Li, J.: On LCD repeated-root cyclic codes over finite fields. J. Appl. Math. Comput. 56(5), 625\u2013635 (2018)","journal-title":"J. Appl. Math. Comput."},{"key":"1876_CR20","unstructured":"Prange, E.: Some cyclic error-correcting codes with simple decoding algorithms. Air Force Cambridge Research Center-TN-58-156, Cambridge (1958)"},{"issue":"6","key":"1876_CR21","doi-asserted-by":"publisher","first-page":"3735","DOI":"10.1109\/TIT.2021.3069772","volume":"67","author":"M Shi","year":"2021","unstructured":"Shi, M., \u00d6zbudak, F., Sol\u00e9, P.: Geometric Approach to $$b$$-symbol Hamming weights of cyclic codes. IEEE Trans. Inf. Theory 67(6), 3735\u20133751 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1876_CR22","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1109\/TIT.2019.2946660","volume":"66","author":"M Shi","year":"2020","unstructured":"Shi, M., Li, X., Neri, A., Sol\u00e9, P.: How many weights can a cyclic code have? IEEE Trans. Inf. Theory 66(3), 1449\u20131459 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1876_CR23","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10801-020-01006-6","volume":"55","author":"M Shi","year":"2022","unstructured":"Shi, M., Helleseth, T., Sol\u00e9, P.: Strongly regular graphs from reducible cyclic codes. J. Algebr. Comb. 55(1), 173\u2013184 (2022)","journal-title":"J. Algebr. Comb."},{"issue":"5","key":"1876_CR24","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s12095-016-0206-5","volume":"9","author":"M Shi","year":"2017","unstructured":"Shi, M., Wu, R., Liu, Y., Sol\u00e9, P.: Two and three weight codes over $$\\mathbb{F} _p+u\\mathbb{F} _p$$. Cryptogr. Commun. 9(5), 637\u2013646 (2017)","journal-title":"Cryptogr. Commun."},{"issue":"2","key":"1876_CR25","first-page":"175","volume":"17","author":"M Shi","year":"2018","unstructured":"Shi, M., Zhu, H., Sol\u00e9, P.: Optimal three-weight cubic codes. Appl. Comput. Math. 17(2), 175\u2013184 (2018)","journal-title":"Appl. Comput. Math."},{"issue":"1","key":"1876_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12095-021-00493-z","volume":"14","author":"D Wang","year":"2022","unstructured":"Wang, D., Cao, X.: A family of optimal ternary cyclic codes with minimum distance five and their duals. Cryptogr. Commun. 14(1), 1\u201313 (2022)","journal-title":"Cryptogr. Commun."},{"key":"1876_CR27","doi-asserted-by":"crossref","unstructured":"Wu, G., Liu, H., Zhang, Y.: Several classes of optimal $$p$$-ary cyclic codes with minimal distance four. arXiv: 2208.14404 (2022)","DOI":"10.1016\/j.ffa.2023.102275"},{"key":"1876_CR28","doi-asserted-by":"publisher","DOI":"10.1142\/5350","volume-title":"Lectures on Finite Fields and Galois Rings","author":"Z Wan","year":"2003","unstructured":"Wan, Z.: Lectures on Finite Fields and Galois Rings. World Scientific, Singapore (2003)"},{"issue":"7","key":"1876_CR29","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(7), 126\u2013137 (2016)","journal-title":"Finite Fields Appl."},{"issue":"3","key":"1876_CR30","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ffa.2016.11.004","volume":"44","author":"S Yang","year":"2017","unstructured":"Yang, S., Yao, Z., Zhao, C.: The weight distributions of two classes of $$p$$-ary cyclic codes with few weights. Finite Fields Appl. 44(3), 76\u201391 (2017)","journal-title":"Finite Fields Appl."},{"issue":"3","key":"1876_CR31","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(3), 101995 (2022)","journal-title":"Finite Fields Appl."},{"issue":"5","key":"1876_CR32","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1007\/s10623-022-01030-6","volume":"90","author":"H Zhu","year":"2022","unstructured":"Zhu, H., Shi, M., \u00d6zbudak, F.: Complete $$b$$-symbol weight distribution of some irreducible cyclic codes. Des. Codes Cryptogr. 90(5), 1113\u20131125 (2022)","journal-title":"Des. Codes Cryptogr."},{"issue":"6","key":"1876_CR33","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(6), 101671 (2020)","journal-title":"Finite Fields Appl."},{"issue":"10","key":"1876_CR34","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(10), 101898 (2021)","journal-title":"Finite Fields Appl."},{"issue":"7","key":"1876_CR35","doi-asserted-by":"publisher","first-page":"4826","DOI":"10.1109\/TIT.2011.2145130","volume":"57","author":"Z Zha","year":"2011","unstructured":"Zha, Z., Wang, X.: Almost perfect nonlinear power functions in odd characteristic. IEEE Trans. Inf. Theory 57(7), 4826\u20134832 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"1876_CR36","doi-asserted-by":"publisher","first-page":"6674","DOI":"10.1109\/TIT.2013.2267722","volume":"59","author":"Z Zhou","year":"2013","unstructured":"Zhou, Z., Ding, C., Luo, J.: A family of five-weight cyclic codes and their weight enumerators. IEEE Trans. Inf. Theory 59(10), 6674\u20136682 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"1876_CR37","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."},{"issue":"1","key":"1876_CR38","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(1), 79\u201393 (2014)","journal-title":"Finite Fields Appl."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01876-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01876-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01876-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T05:53:34Z","timestamp":1702533214000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01876-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,27]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1876"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01876-6","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2023,5,27]]},"assertion":[{"value":"8 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2023","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"}}]}}