{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:25:53Z","timestamp":1769315153396,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T00:00:00Z","timestamp":1705881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T00:00:00Z","timestamp":1705881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62172337"],"award-info":[{"award-number":["62172337"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Key Project of Gansu Natural Science Foundation","award":["23JRRA685"],"award-info":[{"award-number":["23JRRA685"]}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["research projects J1- 4084, J1-2451 and N1-0159"],"award-info":[{"award-number":["research projects J1- 4084, J1-2451 and N1-0159"]}],"id":[{"id":"10.13039\/501100004329","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":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Linear codes play a crucial role in various fields of engineering and mathematics, including data storage, communication, cryptography, and combinatorics. Minimal linear codes, a subset of linear codes, are particularly essential for designing effective secret sharing schemes. In this paper, we introduce several classes of minimal binary linear codes by carefully selecting appropriate Boolean functions. These functions belong to a renowned class of Boolean functions, namely, the general Maiorana\u2013McFarland class. We employ a method first proposed by Ding et al.\u00a0 (IEEE Trans Inf Theory 64(10):6536\u20136545, 2018) to construct minimal codes violating the Ashikhmin\u2013Barg bound (wide minimal codes) by using Krawtchouk polynomials. The lengths, dimensions, and weight distributions of the obtained codes are determined using the Walsh spectrum distribution of the chosen Boolean functions. Our findings demonstrate that a vast majority of the newly constructed codes are wide minimal. Furthermore, our proposed codes exhibit a significantly larger minimum distance, in some cases, compared to some existing similar constructions. Finally, we address this method, based on Krawtchouk polynomials, more generally, and highlight certain generic properties related to it. These general results offer insights into the scope of this approach.<\/jats:p>","DOI":"10.1007\/s10623-023-01353-y","type":"journal-article","created":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T14:02:31Z","timestamp":1705932151000},"page":"1455-1475","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Infinite families of minimal binary codes via Krawtchouk polynomials"],"prefix":"10.1007","volume":"92","author":[{"given":"Xiaoni","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2894-3871","authenticated-orcid":false,"given":"Ren\u00e9","family":"Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,22]]},"reference":[{"issue":"4","key":"1353_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.28991\/esj-2020-01229","volume":"4","author":"S Alkavur","year":"2020","unstructured":"Alkavur S.: A study on Multisecret-Sharing schemes based on linear codes. Emerg. Sci. J. 4(4), 263\u2013271 (2020).","journal-title":"Emerg. Sci. J."},{"issue":"5","key":"1353_CR2","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1109\/18.705584","volume":"44","author":"A Ashikhmin","year":"1998","unstructured":"Ashikhmin A., Barg A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010\u20132017 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1353_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10801-019-00930-6","volume":"53","author":"M Bonini","year":"2021","unstructured":"Bonini M., Borello M.: Minimal linear codes arising from blocking sets. J. Algebr. Comb. 53, 327\u2013341 (2021).","journal-title":"J. Algebr. Comb."},{"key":"1353_CR4","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1007\/s10623-017-0442-5","volume":"86","author":"S Chang","year":"2018","unstructured":"Chang S., Hyun J.: Linear codes from simplicial complexes. Des. Codes Cryptogr. 86, 2167\u20132181 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"1353_CR5","doi-asserted-by":"crossref","unstructured":"Choi S.T., Kim J.Y., No J.S., Chung H.: Weight distribution of some cyclic codes. In: 2012 IEEE International Symposium on Information Theory Proceedings, 2901-2903 (2012).","DOI":"10.1109\/ISIT.2012.6284056"},{"key":"1353_CR6","doi-asserted-by":"crossref","unstructured":"Cohen G.D., Mesnager S., Patey A.: On minimal and quasi-minimal linear codes. In: IMA International Conference on Cryptography and Coding, pp. 85-98. Springer, Berlin (2013).","DOI":"10.1007\/978-3-642-45239-0_6"},{"issue":"10","key":"1353_CR7","doi-asserted-by":"publisher","first-page":"6536","DOI":"10.1109\/TIT.2018.2819196","volume":"64","author":"C Ding","year":"2018","unstructured":"Ding C., Heng Z., Zhou Z.: Minimal binary linear codes. IEEE Trans. Inf. Theory 64(10), 6536\u20136545 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"1353_CR8","first-page":"7","volume":"44","author":"X Du","year":"2022","unstructured":"Du X., Hu J., Jin W., Sun Y.: Construction of two classes of minimal binary linear codes. J. Electron. Inf. Technol. 44(10), 7 (2022).","journal-title":"J. Electron. Inf. Technol."},{"key":"1353_CR9","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ffa.2018.08.010","volume":"54","author":"Z Heng","year":"2018","unstructured":"Heng Z., Ding C., Zhou Z.: Minimal linear codes over finite fields. Finite Fields Appl. 54, 176\u2013196 (2018).","journal-title":"Finite Fields Appl."},{"issue":"5","key":"1353_CR10","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1109\/18.412678","volume":"41","author":"VI Levenshtein","year":"1995","unstructured":"Levenshtein V.I.: Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces. IEEE Trans. Inf. Theory 41(5), 1303\u20131321 (1995).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1353_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10623-019-00682-1","volume":"88","author":"X Li","year":"2020","unstructured":"Li X., Yue Q.: Four classes of minimal binary linear codes with $$w_{min}\/w_{max} <1\/2$$ derived from Boolean functions. Des. Codes Cryptogr. 88, 257\u2013271 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"1353_CR12","first-page":"16","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, p. 16. Elsevier, Amsterdam (1977)."},{"key":"1353_CR13","first-page":"114","volume":"44","author":"RJ McEliece","year":"1978","unstructured":"McEliece R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 44, 114\u2013116 (1978).","journal-title":"DSN Prog. Rep."},{"issue":"9","key":"1353_CR14","doi-asserted-by":"publisher","first-page":"5404","DOI":"10.1109\/TIT.2020.2978387","volume":"66","author":"S Mesnager","year":"2020","unstructured":"Mesnager S., Qi Y., Ru H., Tang C.: Minimal linear codes from characteristic functions. IEEE Trans. Inf. Theory 66(9), 5404\u20135413 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1353_CR15","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"},{"issue":"9","key":"1353_CR16","doi-asserted-by":"publisher","first-page":"2877","DOI":"10.1109\/TMC.2020.2990871","volume":"20","author":"R Nieminen","year":"2020","unstructured":"Nieminen R., Jarvinen K.: Practical privacy-preserving indoor localization based on secure two-party computation. IEEE Trans. Mob. Comput. 20(9), 2877\u20132890 (2020).","journal-title":"IEEE Trans. Mob. Comput."},{"key":"1353_CR17","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s12095-021-00491-1","volume":"13","author":"E Pasalic","year":"2021","unstructured":"Pasalic E., Rodr\u00edguez R., Zhang F., Wei Y.: Several classes of minimal binary linear codes violating the Aschikhmin-Barg bound. Cryptogr. Commun. 13, 637\u2013659 (2021).","journal-title":"Cryptogr. Commun."},{"key":"1353_CR18","unstructured":"Wolfram Research, Inc.: Mathematica, Version 11.3, Champaign, IL (2018)."},{"issue":"4","key":"1353_CR19","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/s12095-021-00553-4","volume":"14","author":"X Wu","year":"2022","unstructured":"Wu X., Lu W., Cao X.: Minimal linear codes constructed from functions. Cryptogr. Commun. 14(4), 875\u2013895 (2022).","journal-title":"Cryptogr. Commun."},{"issue":"11","key":"1353_CR20","doi-asserted-by":"publisher","first-page":"7067","DOI":"10.1109\/TIT.2019.2918537","volume":"65","author":"G Xu","year":"2019","unstructured":"Xu G., Qu L.: Three classes of minimal linear codes over the finite fields of odd characteristic. IEEE Trans. Inf. Theory 65(11), 7067\u20137078 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1353_CR21","doi-asserted-by":"publisher","first-page":"101688","DOI":"10.1016\/j.ffa.2020.101688","volume":"65","author":"G Xu","year":"2020","unstructured":"Xu G., Qu L., Cao X.: Minimal linear codes from Maiorana-McFarland functions. Finite Fields Appl. 65, 101688 (2020).","journal-title":"Finite Fields Appl."},{"issue":"2","key":"1353_CR22","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s12095-021-00519-6","volume":"14","author":"G Xu","year":"2022","unstructured":"Xu G., Qu L., Luo G.: Minimal linear codes from weakly regular bent functions. Cryptogr. Commun. 14(2), 415\u2013431 (2022).","journal-title":"Cryptogr. Commun."},{"issue":"7","key":"1353_CR23","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1007\/s10623-021-00883-7","volume":"89","author":"F Zhang","year":"2021","unstructured":"Zhang F., Pasalic E., Rodr\u00edguez R., Wei Y.: Wide minimal binary linear codes from the general Maiorana-McFarland class. Des. Codes Cryptogr. 89(7), 1485\u20131507 (2021).","journal-title":"Des. Codes Cryptogr."},{"key":"1353_CR24","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1007\/s10623-022-01037-z","volume":"90","author":"F Zhang","year":"2022","unstructured":"Zhang F., Pasalic E., Rodr\u00edguez R., Wei Y.: Minimal binary linear codes: a general framework based on bent concatenation. Des. Codes Cryptogr. 90, 1289\u20131318 (2022).","journal-title":"Des. Codes Cryptogr."},{"issue":"7","key":"1353_CR25","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.disc.2015.02.005","volume":"338","author":"D Zheng","year":"2015","unstructured":"Zheng D., Wang X., Yu L., Liu H.: The weight enumerators of several classes of $$p$$-ary cyclic codes. Discret. Math. 338(7), 1264\u20131276 (2015).","journal-title":"Discret. Math."},{"issue":"1","key":"1353_CR26","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":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01353-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01353-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01353-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T18:06:59Z","timestamp":1715969219000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01353-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,22]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["1353"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01353-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,22]]},"assertion":[{"value":"8 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 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":"There are no competing interests with other researchers or scientific institutions.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"There are no ethical issues concerning the submitted article since its topic is coding theory and cryptography and therefore it does not include a study on humans or animals.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval and Consent to participate"}},{"value":"The authors give their consent for possible publication of the submitted material.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}