{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T22:17:04Z","timestamp":1769897824247,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T00:00:00Z","timestamp":1766534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T00:00:00Z","timestamp":1766534400000},"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":["62032009"],"award-info":[{"award-number":["62032009"]}],"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":["12441102"],"award-info":[{"award-number":["12441102"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s10623-025-01773-y","type":"journal-article","created":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T07:15:34Z","timestamp":1766560534000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal CIS codes, optimal t-CIS codes and their applications in cryptography"],"prefix":"10.1007","volume":"94","author":[{"given":"Hao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Conghui","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,24]]},"reference":[{"issue":"1","key":"1773_CR1","doi-asserted-by":"publisher","first-page":"189","DOI":"10.3934\/amc.2018013","volume":"12","author":"A Alahmadi","year":"2018","unstructured":"Alahmadi A., G\u00fcneri C., Shoaib H., Sol\u00e9 P.: Long quasi-polycyclic $$t$$-CIS codes. Adv. Math. Commun. 12(1), 189\u2013198 (2018).","journal-title":"Adv. Math. Commun."},{"key":"1773_CR2","unstructured":"Bhasin S., Carlet C., Guilley S.: Theory of masking with codewords in hardware: low-weight $$d$$th-order correlation-immune Boolean functions. In: Proceedings of IACR, pp. 1\u201337 (2013)."},{"key":"1773_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1008337029047","volume":"16","author":"P Camion","year":"1999","unstructured":"Camion P., Canteaut A.: Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography. Des. Codes Cryptogr. 16, 121\u2013149 (1999).","journal-title":"Des. Codes Cryptogr."},{"key":"1773_CR4","doi-asserted-by":"crossref","unstructured":"Camion P., Carlet C., Charpin P., Sendrier N.: On correlation-immune functions. In: Advances in Cryptology\u2014CRYPTO 1991, vol. 576, pp. 86\u2013100. Springer, Heidelberg (1991).","DOI":"10.1007\/3-540-46766-1_6"},{"key":"1773_CR5","volume-title":"Boolean functions for cryptography and coding theory","author":"C Carlet","year":"2021","unstructured":"Carlet C.: Boolean functions for cryptography and coding theory. Cambridge University Press, Cambridge (2021)."},{"issue":"4","key":"1773_CR6","doi-asserted-by":"publisher","first-page":"2969","DOI":"10.1109\/TIT.2017.2785775","volume":"64","author":"C Carlet","year":"2018","unstructured":"Carlet C., Chen X.: Constructing low-weight $$d$$th-order correlation-immune Boolean functions through the Fourier-Hadamard transform. IEEE Trans. Inf. Theory 64(4), 2969\u20132978 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1773_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1008344232130","volume":"15","author":"C Carlet","year":"1998","unstructured":"Carlet C., Charpin P., Zinoviev V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15, 125\u2013156 (1998).","journal-title":"Des. Codes Cryptogr."},{"issue":"9","key":"1773_CR8","doi-asserted-by":"publisher","first-page":"6000","DOI":"10.1109\/TIT.2012.2200651","volume":"58","author":"C Carlet","year":"2012","unstructured":"Carlet C., Gaborit P., Kim J.-L., Sol\u00e9 P.: A new class of codes for Boolean masking of cryptographic computations. IEEE Trans. Inf. Theory 58(9), 6000\u20136011 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1773_CR9","doi-asserted-by":"publisher","first-page":"5283","DOI":"10.1109\/TIT.2014.2332468","volume":"60","author":"C Carlet","year":"2014","unstructured":"Carlet C., Freibert F., Guilley S., Kiermaier M., Kim J.-L., Sol\u00e9 P.: Higher-order CIS codes. IEEE Trans. Inf. Theory 60(9), 5283\u20135295 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1773_CR10","doi-asserted-by":"publisher","first-page":"2389","DOI":"10.1109\/TIT.2025.3535533","volume":"71","author":"H Chen","year":"2025","unstructured":"Chen H., Ding C.: Self-dual cyclic codes with square-root-like lower bounds on their minimum distances. IEEE Trans. Inf. Theory 71(4), 2389\u20132396 (2025).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1773_CR11","doi-asserted-by":"publisher","first-page":"8734","DOI":"10.1109\/TIT.2024.3464630","volume":"70","author":"T Chen","year":"2024","unstructured":"Chen T., Sun Z., Xie C., Chen H., Ding C.: Two classes of constacyclic codes with a square-root-like lower bound. IEEE Trans. Inf. Theory 70(12), 8734\u20138745 (2024).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1773_CR12","doi-asserted-by":"crossref","unstructured":"Chor B., Goldreich O., Hastad J., Friedman J., Rudich S., Smolensky R.: The bit extraction problem or $$t$$-resilient functions. In: Proceedings of 26th IEEE Symposium of Foundations of Computer Science (FOCS), pp. 396\u2013407 (1985).","DOI":"10.1109\/SFCS.1985.55"},{"issue":"8","key":"1773_CR13","doi-asserted-by":"publisher","first-page":"4715","DOI":"10.1109\/TIT.2019.2907276","volume":"65","author":"C Ding","year":"2019","unstructured":"Ding C., Heng Z.: The subfield codes of ovoid codes. IEEE Trans. Inf. Theory 65(8), 4715\u20134729 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1773_CR14","volume-title":"Designs from Linear Codes","author":"C Ding","year":"2023","unstructured":"Ding C., Tang C.: Designs from Linear Codes, second edition World Scientific Publishing, Singapore (2023).","edition":"second edition"},{"issue":"3","key":"1773_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.3934\/amc.2013.7.267","volume":"7","author":"F Freibert","year":"2013","unstructured":"Freibert F.: The classification of complementary information set codes of length 14 and 16. Adv. Math. Commun. 7(3), 267\u2013278 (2013).","journal-title":"Adv. Math. Commun."},{"key":"1773_CR16","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de."},{"key":"1773_CR17","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"JH Griesmer","year":"1960","unstructured":"Griesmer J.H.: A bound for error-correcting codes. IBM J. Res. Dev. 4, 532\u2013542 (1960).","journal-title":"IBM J. Res. Dev."},{"issue":"107","key":"1773_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0012-365X(92)90553-R","volume":"106","author":"T Helleseth","year":"1992","unstructured":"Helleseth T.: Projective codes meeting the Griesmer bound. Discret. Math. 106(107), 265\u2013271 (1992).","journal-title":"Discret. Math."},{"issue":"5","key":"1773_CR19","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1109\/TIT.1981.1056405","volume":"27","author":"T Helleseth","year":"1981","unstructured":"Helleseth T., van Tilborg H.C.A.: A new class of codes meeting the Griesmer bound. IEEE Trans. Inf. Theory 27(5), 548\u2013555 (1981).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1773_CR20","doi-asserted-by":"publisher","first-page":"4501","DOI":"10.1109\/TIT.2016.2550029","volume":"62","author":"Z Heng","year":"2016","unstructured":"Heng Z., Yue Q.: Several classes of cyclic codes with either optimal three weights or a few weights. IEEE Trans. Inf. Theory 62(8), 4501\u20134513 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1773_CR21","doi-asserted-by":"publisher","first-page":"6872","DOI":"10.1109\/TIT.2020.3006846","volume":"66","author":"Z Heng","year":"2020","unstructured":"Heng Z., Wang Q., Ding C.: Two families of optimal linear codes and their subfield codes. IEEE Trans. Inf. Theory 66(11), 6872\u20136883 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1773_CR22","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 University Press, Cambridge (2003)."},{"key":"1773_CR23","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10623-015-0167-2","volume":"81","author":"Y Kageyama","year":"2016","unstructured":"Kageyama Y., Maruta T.: On the geometric construction of optimal linear codes. Des. Codes Cryptogr. 81, 469\u2013480 (2016).","journal-title":"Des. Codes Cryptogr."},{"key":"1773_CR24","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10623-015-0174-3","volume":"81","author":"HJ Kim","year":"2016","unstructured":"Kim H.J., Lee Y.: Complementary information set codes over $$GF(p)$$. Des. Codes Cryptogr. 81, 541\u2013555 (2016).","journal-title":"Des. Codes Cryptogr."},{"key":"1773_CR25","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/j.dam.2016.09.032","volume":"217","author":"HJ Kim","year":"2017","unstructured":"Kim H.J., Lee Y.: $$t$$-CIS codes over $$GF(p)$$ and orthogonal arrays. Discret. Appl. Math. 217, 601\u2013612 (2017).","journal-title":"Discret. Appl. Math."},{"key":"1773_CR26","series-title":"North-Holland Mathematical Library","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes, vol. 16, 3rd edn North-Holland Mathematical Library. North-Holland, Amsterdam (1977).","edition":"3"},{"key":"1773_CR27","unstructured":"Maruta T.: Griesmer bound for linear codes over finite fields. http:\/\/mars39.lomo.jp\/opu\/griesmer.htm."},{"issue":"11","key":"1773_CR28","doi-asserted-by":"publisher","first-page":"7501","DOI":"10.1109\/TIT.2021.3109946","volume":"67","author":"S Mesnager","year":"2021","unstructured":"Mesnager S., Su S.: On correlation immune Boolean functions with minimum Hamming weight power of 2. IEEE Trans. Inf. Theory 67(11), 7501\u20137517 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1773_CR29","doi-asserted-by":"publisher","first-page":"3285","DOI":"10.1109\/TIT.2023.3236955","volume":"69","author":"S Mesnager","year":"2023","unstructured":"Mesnager S., Qian L., Cao X., Yuan M.: Several families of binary minimal linear codes from two-to-one functions. IEEE Trans. Inf. Theory 69(5), 3285\u20133301 (2023).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1773_CR30","doi-asserted-by":"crossref","unstructured":"Schnorr C.P., Vaudenay S.: Black box cryptanalysis of hash networks based on multipermutations. In: Eurocrypt, LNCS 950, vol. 94, pp. 47\u201357 (1995).","DOI":"10.1007\/BFb0053423"},{"issue":"5","key":"1773_CR31","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1109\/TIT.1984.1056949","volume":"30","author":"T Siegenthaler","year":"1984","unstructured":"Siegenthaler T.: Correlation-immunity of nonlinear combining fuctions for cryptograhic applications. IEEE Trans. Inf. Theory 30(5), 776\u2013780 (1984).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1773_CR32","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/S0019-9958(65)90080-X","volume":"8","author":"G Solomon","year":"1965","unstructured":"Solomon G., Stiffler J.J.: Algebraically punctured cyclic codes. Inf. Control 8(2), 170\u2013179 (1965).","journal-title":"Inf. Control"},{"key":"1773_CR33","doi-asserted-by":"publisher","first-page":"2821","DOI":"10.1007\/s10623-023-01242-4","volume":"91","author":"Z Sun","year":"2023","unstructured":"Sun Z., Wang X., Ding C.: Several families of irreducible constacyclic codes. Des. Codes Cryptogr. 91, 2821\u20132843 (2023).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1773_CR34","doi-asserted-by":"publisher","first-page":"2411","DOI":"10.1109\/TIT.2023.3307732","volume":"70","author":"Z Sun","year":"2024","unstructured":"Sun Z., Li C., Ding C.: An infinite family of binary cyclic codes with best parameters. IEEE Trans. Inf. Theory 70(4), 2411\u20132418 (2024).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1773_CR35","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1109\/18.6037","volume":"34","author":"GZ Xiao","year":"1988","unstructured":"Xiao G.Z., Massey J.L.: A spectral characterization of correlation immune functions. IEEE Trans. Inf. Theory 34, 569\u2013571 (1988).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1773_CR36","doi-asserted-by":"publisher","first-page":"4879","DOI":"10.1109\/TIT.2024.3380613","volume":"70","author":"C Xie","year":"2024","unstructured":"Xie C., Chen H., Ding C., Sun Z.: Self-dual negacyclic codes with variable lengths and square-root-like lower bounds on the minimum distances. IEEE Trans. Inf. Theory 70(7), 4879\u20134888 (2024).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1773_CR37","doi-asserted-by":"publisher","first-page":"4699","DOI":"10.1109\/TIT.2019.2913389","volume":"65","author":"S Zhu","year":"2019","unstructured":"Zhu S., Sun Z., Kai X.: A class of narrow-sense BCH codes. IEEE Trans. Inf. Theory 65(8), 4699\u20134714 (2019).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01773-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01773-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01773-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T17:13:06Z","timestamp":1769447586000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01773-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,24]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["1773"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01773-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,24]]},"assertion":[{"value":"24 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2025","order":4,"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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"14"}}