{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T07:09:10Z","timestamp":1769324950291,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T00:00:00Z","timestamp":1642464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T00:00:00Z","timestamp":1642464000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971102"],"award-info":[{"award-number":["11971102"]}],"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":["11801070"],"award-info":[{"award-number":["11801070"]}],"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":["11801070"],"award-info":[{"award-number":["11801070"]}],"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":[[2022,7]]},"DOI":"10.1007\/s12095-021-00553-4","type":"journal-article","created":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T10:03:27Z","timestamp":1642500207000},"page":"875-895","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Minimal linear codes constructed from functions"],"prefix":"10.1007","volume":"14","author":[{"given":"Xia","family":"Wu","sequence":"first","affiliation":[]},{"given":"Wei","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Xiwang","family":"Cao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,18]]},"reference":[{"issue":"5","key":"553_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"},{"key":"553_CR2","doi-asserted-by":"crossref","unstructured":"Ashikhmin, A., Barg, A., Cohen, G., Huguet, L.: Variations on minimal codewords in linear codes. In: Cohen, G., Giusti, M., Mora, T. (eds.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, (AAECC-11), (Lecture Notes in Computer Science), vol. 948, pp 96\u2013105. Springer-Verlag, Berlin (1995)","DOI":"10.1007\/3-540-60114-7_7"},{"key":"553_CR3","doi-asserted-by":"publisher","unstructured":"Alfarano, G.N., Borello, M., Neri, A.: A geometric characterization of minimal codes and their asymptotic performance. Adv. Math. Commun. https:\/\/doi.org\/10.3934\/amc.2020104","DOI":"10.3934\/amc.2020104"},{"issue":"7","key":"553_CR4","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"},{"issue":"3","key":"553_CR5","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"553_CR6","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. Algebraic Comb. 53, 327\u2013341 (2021)","journal-title":"J. Algebraic Comb."},{"issue":"2","key":"553_CR7","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/18.52484","volume":"36","author":"J Bruck","year":"1990","unstructured":"Bruck, J., Naor, M.: The hardness of decoding linear codes with preprocessing. IEEE Trans. Inf. Theory 36(2), 381\u2013385 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"553_CR8","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":"553_CR9","doi-asserted-by":"crossref","unstructured":"Chabanne, H., Cohen, G., Patey, A.: Towards secure two-party computation from the wire-tap channel. In: Lee, H.-S., Han, D.-G. (eds.) Proceedings of ICISC 2013(Lecture Notes in Computer Science), vol. 8565, pp 34\u201346. Springer-Verlag, Berlin (2014)","DOI":"10.1007\/978-3-319-12160-4_3"},{"key":"553_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, G.D., Mesnager, S., Patey, A.: On minimal and quasi-minimal linear codes. In: Stam, M. (ed.) Proceedings of IMACC (Lecture Notes in Computer Science), vol. 8308, pp 85\u201398. Springer-Verlag, Berlin (2003)","DOI":"10.1007\/978-3-642-45239-0_6"},{"issue":"6","key":"553_CR11","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1109\/TIT.2015.2420118","volume":"61","author":"C Ding","year":"2015","unstructured":"Ding, C.: Linear codes from some 2-designs. IEEE Trans. Inf. Theory 61(6), 3265\u20133275 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"553_CR12","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. Discret. Math. 339(9), 2288\u20132303 (2016)","journal-title":"Discret. Math."},{"key":"553_CR13","doi-asserted-by":"crossref","unstructured":"Ding, C., Yuan, J.: Covering and secret sharing with linear codes. In: Discrete Mathematics and Theoretical Computer Science (Lecture Notes in Computer Science), vol. 2731, pp 11\u201325. Springer-Verlag (2003)","DOI":"10.1007\/3-540-45066-1_2"},{"issue":"10","key":"553_CR14","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":"553_CR15","doi-asserted-by":"publisher","first-page":"5835","DOI":"10.1109\/TIT.2015.2473861","volume":"61","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 61(11), 5835\u20135842 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"553_CR16","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":"553_CR17","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.ffa.2015.12.002","volume":"38","author":"Z Heng","year":"2016","unstructured":"Heng, Z., Yue, Q.: Two classes of two-weight linear codes. Finite Fields Appl. 38, 72\u201392 (2016)","journal-title":"Finite Fields Appl."},{"issue":"5","key":"553_CR18","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s12095-020-00435-1","volume":"12","author":"N Li","year":"2020","unstructured":"Li, N., Mesnager, S.: Recent results and problems on constructions of linear codes from cryptographic functions. Cryptogr. Commun. 12(5), 965\u2013986 (2020)","journal-title":"Cryptogr. Commun."},{"issue":"2","key":"553_CR19","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 derived from Boolean functions. Des. Codes Cryptogr. 88(2), 257\u2013271 (2020)","journal-title":"Des. Codes Cryptogr."},{"key":"553_CR20","doi-asserted-by":"publisher","first-page":"101799","DOI":"10.1016\/j.ffa.2020.101799","volume":"71","author":"W Lu","year":"2021","unstructured":"Lu, W., Wu, X.: The parameters of minimal linear codes. Finite Fields Appl. 71, 101799 (2021)","journal-title":"Finite Fields Appl."},{"issue":"2","key":"553_CR21","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s12095-017-0220-2","volume":"10","author":"G Luo","year":"2018","unstructured":"Luo, G., Cao, X., Xu, S., Mi, J.: Binary linear codes with two or three weights from niho exponents. Cryptogr. Commun. 10(2), 301\u2013318 (2018)","journal-title":"Cryptogr. Commun."},{"key":"553_CR22","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proc. 6th Joint Swedish-Russian Workshop on Information Theory, pp 246\u2013249. M\u00f6lle, Sweden (1993)"},{"issue":"1","key":"553_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s12095-016-0186-5","volume":"9","author":"S Mesnager","year":"2017","unstructured":"Mesnager, S.: Linear codes with few weights from weakly regular bent functions based on a generic construction. Cryptogr. Commun. 9(1), 71\u201384 (2017)","journal-title":"Cryptogr. Commun."},{"key":"553_CR24","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10623-018-0556-4","volume":"87","author":"S Mesnager","year":"2019","unstructured":"Mesnager, S., \u00f6zbudak, F., Sinak, A.: Linear codes from weakly regular plateaued functions and their secret sharing schemes. Des. Codes Cryptogr. 87, 463\u2013480 (2019)","journal-title":"Des. Codes Cryptogr."},{"issue":"9","key":"553_CR25","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.F., Ru, H.M., Tang, C.M.: Minimal linear codes from characteristic functions. IEEE Trans. Inf. Theory 66(9), 5404\u20135413 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"553_CR26","volume-title":"Linear Codes from Functions, Chapter 20 in A Concise Encyclopedia of Coding Theory","author":"S Mesnager","year":"2021","unstructured":"Mesnager, S.: Linear Codes from Functions, Chapter 20 in A Concise Encyclopedia of Coding Theory. CRC Press, Taylor and Francis Group, London, New York (2021)"},{"issue":"12","key":"553_CR27","doi-asserted-by":"publisher","first-page":"2346","DOI":"10.1109\/LCOMM.2016.2614934","volume":"20","author":"M Shi","year":"2016","unstructured":"Shi, M., Liu, Y., Sol\u00e9, P.: Optimal two weight codes from trace codes over $\\mathbb {F}_{p} + u\\mathbb {F}_{p}$. IEEE Commun. Lett. 20(12), 2346\u20132349 (2016)","journal-title":"IEEE Commun. Lett."},{"issue":"10","key":"553_CR28","doi-asserted-by":"publisher","first-page":"6240","DOI":"10.1109\/TIT.2017.2742499","volume":"63","author":"M Shi","year":"2017","unstructured":"Shi, M., Guan, Y., Sol\u00e9, P: Two new families of two-weight codes. IEEE Trans. Inf. Theory 63(10), 6240\u20136246 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"553_CR29","unstructured":"Tang, C., Qiu, Y., Liao, Q., Zhou, Z.: Full characterization of minimal linear codes as cutting blocking sets. arXiv:1911.09867"},{"issue":"3","key":"553_CR30","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, F., 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"},{"issue":"7","key":"553_CR31","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1109\/LCOMM.2015.2431253","volume":"19","author":"Q Wang","year":"2015","unstructured":"Wang, Q., Ding, K., Xue, R.: Binary linear sodes with two weights. IEEE Commun. Lett 19(7), 1097\u20131100 (2015)","journal-title":"IEEE Commun. Lett"},{"issue":"4","key":"553_CR32","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s12095-015-0158-1","volume":"8","author":"C Xiang","year":"2016","unstructured":"Xiang, C.: Linear codes from a generic construction. Cryptogr. Commun. 8(4), 525\u2013539 (2016)","journal-title":"Cryptogr. Commun."},{"issue":"3","key":"553_CR33","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s10623-016-0191-x","volume":"82","author":"S Yang","year":"2017","unstructured":"Yang, S., Yao, Z.: Complete weight enumerators of a family of three-weight linear codes. Des. Codes Cryptogr. 82(3), 663\u2013674 (2017)","journal-title":"Des. Codes Cryptogr."},{"key":"553_CR34","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":"11","key":"553_CR35","doi-asserted-by":"publisher","first-page":"7067","DOI":"10.1109\/TIT.2019.2918537","volume":"65","author":"GK Xu","year":"2017","unstructured":"Xu, G.K., Qu, L.J.: Three classes of minimal linear codes over the finite fields of odd characteristic. IEEE Trans. Inf. Theory 65(11), 7067\u20137078 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"553_CR36","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"},{"issue":"2","key":"553_CR37","doi-asserted-by":"publisher","first-page":"175","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 $\\frac {w_{\\min \\limits }}{w_{\\max \\limits }}\\leq \\frac {1}{2}$. Appl. Algerbra Eng. Commun. Comput. 30(2), 175\u2013184 (2019)","journal-title":"Appl. Algerbra Eng. Commun. Comput."},{"issue":"2","key":"553_CR38","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10623-015-0144-9","volume":"81","author":"Z Zhou","year":"2016","unstructured":"Zhou, Z., Li, N., Fan, C., Helleseth, T: Linear codes with two or three weights from quadratic bent functions. Des. Codes Cryptogr. 81(2), 283\u2013295 (2016)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00553-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-021-00553-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00553-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T05:13:32Z","timestamp":1654578812000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-021-00553-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,18]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["553"],"URL":"https:\/\/doi.org\/10.1007\/s12095-021-00553-4","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,18]]},"assertion":[{"value":"15 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}