{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T18:00:16Z","timestamp":1781373616420,"version":"3.54.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T00:00:00Z","timestamp":1620259200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T00:00:00Z","timestamp":1620259200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972400"],"award-info":[{"award-number":["61972400"]}],"id":[{"id":"10.13039\/100014718","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":[[2021,7]]},"DOI":"10.1007\/s10623-021-00883-7","type":"journal-article","created":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T10:03:21Z","timestamp":1620295401000},"page":"1485-1507","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Wide minimal binary linear codes from the general Maiorana\u2013McFarland class"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6804-6975","authenticated-orcid":false,"given":"Fengrong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Enes","family":"Pasalic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ren\u00e9","family":"Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongzhuang","family":"Wei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,5,6]]},"reference":[{"issue":"5","key":"883_CR1","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"},{"issue":"7","key":"883_CR2","doi-asserted-by":"publisher","first-page":"4152","DOI":"10.1109\/TIT.2019.2891992","volume":"65","author":"D Bartoli","year":"2019","unstructured":"Bartoli D., Bonini M.: Minimal linear codes in odd characteristic. IEEE Trans. Inf. Theory 65(7), 4152\u20134155 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"883_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-019-00930-6","author":"M Bonini","year":"2021","unstructured":"Bonini M., Borello M.: Minimal linear codes arising from blocking sets. J. Algebr. Comb. (2021). https:\/\/doi.org\/10.1007\/s10801-019-00930-6.","journal-title":"J. Algebr. Comb."},{"key":"883_CR4","first-page":"398","volume-title":"Encyclopedia of Mathematics and its Applications","author":"C Carlet","year":"2010","unstructured":"Carlet C.: Boolean models and methods in mathematics, computer science, and engineering. In: Crama Y., Hammer P. (eds.) Encyclopedia of Mathematics and its Applications, pp. 398\u2013468. Cambridge University Press, Cambridge (2010)."},{"issue":"6","key":"883_CR5","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 highly nonlinear functions and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089\u20132102 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"883_CR6","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."},{"issue":"9","key":"883_CR7","doi-asserted-by":"publisher","first-page":"2288","DOI":"10.1016\/j.disc.2016.03.029","volume":"339","author":"C Ding","year":"2016","unstructured":"Ding C.: A construction of binary linear codes from Boolean functions. Discrete Math. 339(9), 2288\u20132303 (2016).","journal-title":"Discrete Math."},{"issue":"10","key":"883_CR8","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":"11","key":"883_CR9","doi-asserted-by":"publisher","first-page":"5835","DOI":"10.1109\/TIT.2015.2473861","volume":"64","author":"K Ding","year":"2015","unstructured":"Ding K., Ding C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 64(11), 5835\u20135842 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"883_CR10","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."},{"key":"883_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_{\\text{ min }\/w_{\\text{ max }}} < 1\/2$$ derived from Boolean functions. Des. Codes Cryptogr. 88, 257\u2013271 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"883_CR12","volume-title":"The Theory of Error-correcting Codes","author":"F MacWilliams","year":"1977","unstructured":"MacWilliams F., Sloane N.: The Theory of Error-correcting Codes. North Holland, Amsterdam (1977)."},{"key":"883_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0097-3165(73)90031-9","volume":"15","author":"R McFarland","year":"1973","unstructured":"McFarland R.: A family of difference sets in non-cyclic groups. J. Comb. Theory (series A) 15, 1\u201310 (1973).","journal-title":"J. Comb. Theory (series A)"},{"issue":"2\u20133","key":"883_CR14","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10623-018-0556-4","volume":"87","author":"S Mesnager","year":"2019","unstructured":"Mesnager S., \u00d6zbudak F., S\u0131nak A.: Linear codes from weakly regular plateaued functions and their secret sharing schemes. Des. Codes Crypt. 87(2\u20133), 463\u2013480 (2019).","journal-title":"Des. Codes Crypt."},{"issue":"9","key":"883_CR15","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"},{"key":"883_CR16","doi-asserted-by":"crossref","unstructured":"Pasalic, E., Rodr\u00edguez, R., Zhang, F., Wei, Y.: Several classes of minimal binary linear codes violating the Ashikhmin\u2013Barg\u2019s bound (2020). https:\/\/eprint.iacr.org\/2020\/1131","DOI":"10.1007\/s12095-021-00491-1"},{"key":"883_CR17","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0097-3165(76)90024-8","volume":"20","author":"O Rothaus","year":"1976","unstructured":"Rothaus O.: On bent functions. J. Comb. Theory (series A) 20, 300\u2013305 (1976).","journal-title":"J. Comb. Theory (series A)"},{"key":"883_CR18","unstructured":"Sorci, J.: Minimal codes from characteristic functions not satisfying Ashikhmin\u2013Barg\u2019s condition (2019). arXiv:1912.12769"},{"issue":"3","key":"883_CR19","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1109\/TIT.2016.2518678","volume":"62","author":"C Tang","year":"2016","unstructured":"Tang C., Li N., Qi Y., Zhou Z., Helleseth T.: Linear codes with two or three weights from weakly regular bent functions. IEEE Trans. Inf. Theory 62(3), 1166\u20131176 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"883_CR20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3070377","author":"C Tang","year":"2021","unstructured":"Tang C., Qiu Y., Liao Q., Zhou Z.: Full characterization of minimal linear codes as cutting blocking sets. IEEE Trans. Inf. Theory (2021). https:\/\/doi.org\/10.1109\/TIT.2021.3070377.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"883_CR21","unstructured":"Wu, X., Lu, W., Cao, X.: Minimal linear codes constructed from functions (2019). arXiv:1911.11632"},{"key":"883_CR22","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s00200-016-0298-3","volume":"28","author":"G Xu","year":"2017","unstructured":"Xu G., Cao X., Xu S.: Several classes of Boolean functions with few Walsh transform values. Appl. Algebra Eng. Commun. Comput. 28, 155\u2013176 (2017).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"11","key":"883_CR23","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"},{"issue":"1","key":"883_CR24","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1109\/TIT.2005.860412","volume":"52","author":"J Yuan","year":"2006","unstructured":"Yuan J., Ding C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 52(1), 206\u2013212 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"883_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, F., Pasalic, E., Rodr\u00edguez, R., Wei, Y.: A huge class of infinite sequences of minimal binary linear codes with or without crossing the Ashikhmin\u2013Barg\u2019s bound (2020). https:\/\/eprint.iacr.org\/2020\/1398","DOI":"10.1007\/s12095-021-00491-1"},{"key":"883_CR26","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00200-018-0367-x","volume":"30","author":"W Zhang","year":"2019","unstructured":"Zhang W., Yan H., Wei H.: Four families of minimal binary linear codes with $$w_{\\rm min\\rm \/w_{\\rm max}\\rm \\le 1\/2}$$. Appl. Algebra Eng. Commun. Comput. 30, 75\u2013184 (2019).","journal-title":"Appl. Algebra Eng. Commun. Comput."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00883-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00883-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00883-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T19:31:50Z","timestamp":1623699110000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00883-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,6]]},"references-count":26,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["883"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00883-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,6]]},"assertion":[{"value":"8 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}