{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T23:20:42Z","timestamp":1773098442723,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T00:00:00Z","timestamp":1706227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T00:00:00Z","timestamp":1706227200000},"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":["12171241"],"award-info":[{"award-number":["12171241"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s12095-024-00697-z","type":"journal-article","created":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T13:02:02Z","timestamp":1706274122000},"page":"745-765","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the parameters of some LCD BCH codes over $$\\mathbb {F}_q$$ with length $$(q^m+1)\/\\lambda $$"],"prefix":"10.1007","volume":"16","author":[{"given":"Hanglong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Xiwang","family":"Cao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,26]]},"reference":[{"key":"697_CR1","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/18.272483","volume":"40","author":"D Augot","year":"1994","unstructured":"Augot, D., Sendrier, N.: Idempotents and the BCH bound. IEEE Trans. Inf. Theory 40, 204\u2013207 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"697_CR2","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1109\/18.135638","volume":"38","author":"D Augot","year":"1992","unstructured":"Augot, D., Charpin, P., Sendrier, N.: Studying the locator polynomials of minimum weight codewords of BCH codes. IEEE Trans. Inf. Theory 38, 960\u2013973 (1992)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"697_CR3","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0019-9958(60)90287-4","volume":"3","author":"RC Bose","year":"1960","unstructured":"Bose, R.C., Ray-Chaudhuri, D.K.: On a class of error correcting binary group codes. Inf. Control 3, 68\u201379 (1960)","journal-title":"Inf. Control"},{"key":"697_CR4","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A Canteaut","year":"1998","unstructured":"Canteaut, A., Chabaud, F.: A new algorithm for finding minimum weight words in a linear code: Application to McEliece\u2019s cryptosystem and to narrow-sense BCH codes of length 511. IEEE Trans. Inf. Theory 44, 367\u2013378 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"697_CR5","first-page":"963","volume":"1","author":"P Charpin","year":"1998","unstructured":"Charpin, P.: Open problems on cyclic codes. Handbook Coding Theory. 1, 963\u20131063 (1998)","journal-title":"Handbook Coding Theory."},{"key":"697_CR6","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1109\/18.50397","volume":"36","author":"P Charpin","year":"1990","unstructured":"Charpin, P.: On a class of primitive BCH-codes. IEEE Trans. Inf. Theory 36, 222\u2013228 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"697_CR7","doi-asserted-by":"publisher","first-page":"2351","DOI":"10.1109\/TIT.2015.2409838","volume":"61","author":"C Ding","year":"2015","unstructured":"Ding, C., Du, X., Zhou, Z.: The Bose and minimum distance of a class of BCH Codes. IEEE Trans. Inf. Theory 61, 2351\u20132356 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"697_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.ffa.2016.12.009","volume":"45","author":"C Ding","year":"2017","unstructured":"Ding, C., Fan, C., Zhou, Z.: The dimension and minimum distance of two classes of primitive BCH codes. Finite Fields Appl. 45, 237\u2013263 (2017)","journal-title":"Finite Fields Appl."},{"key":"697_CR9","unstructured":"Ding C.: BCH codes in the past 55 years. in Proc. 7th. Int. Worhshop Finite Fields Appl., Tianjing, China, (2016)"},{"key":"697_CR10","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. Online available at http:\/\/www.codetables.de"},{"key":"697_CR11","first-page":"147","volume":"2","author":"A Hocquenghem","year":"1959","unstructured":"Hocquenghem, A.: Codes correcteurs d\u2019erreurs. Chiffres 2, 147\u2013156 (1959)","journal-title":"Chiffres"},{"key":"697_CR12","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TIT.1972.1054903","volume":"18","author":"T Kasami","year":"1972","unstructured":"Kasami, T., Lin, S.: Some results on the minimum weight of primitive BCH codes. IEEE Trans. Inf. Theory 18, 824\u2013825 (1972)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"697_CR13","first-page":"100","volume":"50","author":"T Kasami","year":"1967","unstructured":"Kasami, T., Lin, S., Peterson, W.W.: Linear codes which are invariant under the affine group and some results on minimum weights in BCH codes. Electron. Commun. Jpn. 50, 100\u2013106 (1967)","journal-title":"Electron. Commun. Jpn."},{"key":"697_CR14","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, 4344\u20134356 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"697_CR15","first-page":"5699","volume":"63","author":"S Li","year":"2017","unstructured":"Li, S., Li, C., Ding, C., Liu, H.: Two families of LCD BCH codes. IEEE Trans. Inf. Theory 63, 5699\u20135717 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"697_CR16","doi-asserted-by":"publisher","first-page":"1910","DOI":"10.1016\/j.disc.2017.04.001","volume":"340","author":"H Liu","year":"2017","unstructured":"Liu, H., Ding, C., Li, C.: Dimensions of three types of BCH codes over GF($$q$$). Discrete Math. 340, 1910\u20131927 (2017)","journal-title":"Discrete Math."},{"key":"697_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ffa.2018.09.005","volume":"55","author":"Y Liu","year":"2019","unstructured":"Liu, Y., Li, Y., Fu, Q., Lu, L., Rao, Y.: Some binary BCH codes with length $$n = 2^m +1$$. Finite Fields Appl. 55, 109\u2013133 (2019)","journal-title":"Finite Fields Appl."},{"issue":"9","key":"697_CR18","doi-asserted-by":"publisher","first-page":"113496","DOI":"10.1016\/j.disc.2023.113496","volume":"346","author":"Y Liu","year":"2023","unstructured":"Liu, Y., Li, R., Guo, L., Song, H.: Dimensions of nonbinary antiprimitive BCH codes and some conjectures. Discrete Math. 346(9), 113496 (2023)","journal-title":"Discrete Math."},{"key":"697_CR19","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, 297\u2013309 (2020)","journal-title":"Des. Codes Cryptogr."},{"key":"697_CR20","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10623-015-0138-7","volume":"81","author":"Y Liu","year":"2016","unstructured":"Liu, Y., Liu, C.: A class of cyclic codes whose duals have five zeros. Des. Codes Cryptogr. 81, 225\u2013238 (2016)","journal-title":"Des. Codes Cryptogr."},{"key":"697_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-014-9984-y","volume":"77","author":"Y Liu","year":"2015","unstructured":"Liu, Y., Yan, H., Liu, C.: A class of six-weight cyclic codes and their weight distribution. Des. Codes Cryptogr. 77, 1\u20139 (2015)","journal-title":"Des. Codes Cryptogr."},{"key":"697_CR22","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/S0019-9958(64)90438-3","volume":"7","author":"JL Massey","year":"1963","unstructured":"Massey, J.L.: Reversible codes. Inf. Control 7, 369\u2013380 (1963)","journal-title":"Inf. Control"},{"key":"697_CR23","doi-asserted-by":"crossref","unstructured":"Shi, M., Liu, N., \u00d6zbudak, F., Sol\u00e9, P.: Additive cyclic complementary dual codes over $$\\mathbb{F} _4$$. Finite Fields Appl. 83, 102087 (2022)","DOI":"10.1016\/j.ffa.2022.102087"},{"key":"697_CR24","doi-asserted-by":"publisher","first-page":"579","DOI":"10.3934\/amc.2018034","volume":"12","author":"H Yan","year":"2018","unstructured":"Yan, H., Liu, H., Li, C., Yang, S.: Parameters of LCD BCH codes with two lengths. Adv. Math. Commun. 12, 579\u2013594 (2018)","journal-title":"Adv. Math. Commun."},{"key":"697_CR25","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0012-365X(94)90283-6","volume":"126","author":"X Yang","year":"1994","unstructured":"Yang, X., Massey, J.L.: The condition for a cyclic code to have a complementary dual. Discrete Math. 126, 391\u2013393 (1994)","journal-title":"Discrete Math."},{"key":"697_CR26","first-page":"216","volume":"13","author":"D Yue","year":"1996","unstructured":"Yue, D., Hu, Z.: On the dimension and minimum distance of BCH codes over GF($$q$$). J. Electron. 13, 216\u2013221 (1996)","journal-title":"J. Electron."},{"key":"697_CR27","doi-asserted-by":"publisher","first-page":"2625","DOI":"10.1109\/18.887870","volume":"46","author":"D Yue","year":"2000","unstructured":"Yue, D., Feng, G.: Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa codes. IEEE Trans. Inf. Theory 46, 2625\u20132628 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"697_CR28","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/4234.784583","volume":"3","author":"D Yue","year":"1999","unstructured":"Yue, D., Zhu, H.: On the minimum distance of composite-length BCH codes. IEEE Commun. Lett. 3, 269\u2013271 (1999)","journal-title":"IEEE Commun. Lett."},{"key":"697_CR29","unstructured":"Zhang J., Li P., Kai X. and Sun Z.: Some results on BCH codes of length $$\\frac{{{q^ m}+ 1}}{2}$$. Adv. Math. Commun., (2023)"},{"key":"697_CR30","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1109\/TIT.2021.3131810","volume":"68","author":"H Zhu","year":"2022","unstructured":"Zhu, H., Shi, M., Wang, X., Helleseth, T.: The $$q$$-Ary Antiprimitive BCH Codes. IEEE Trans. Inf. Theory 68, 1683\u20131695 (2022)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00697-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00697-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00697-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T07:09:53Z","timestamp":1731136193000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00697-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,26]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["697"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00697-z","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,26]]},"assertion":[{"value":"5 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2024","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 that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}