{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:31:53Z","timestamp":1762507913922},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T00:00:00Z","timestamp":1573171200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T00:00:00Z","timestamp":1573171200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s12095-019-00412-3","type":"journal-article","created":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T16:10:07Z","timestamp":1573229407000},"page":"375-388","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A note on the minimal binary linear code"],"prefix":"10.1007","volume":"12","author":[{"given":"Deng","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xia","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,8]]},"reference":[{"issue":"2","key":"412_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1026421315292","volume":"15","author":"RJ Anderson","year":"1998","unstructured":"Anderson, R.J., Ding, C., Helleseth, T., Kl\u00f8ve, T.: How to build robust shared control systems. Des. Codes Cryptogr. 15(2), 111\u2013124 (1998). \nhttps:\/\/doi.org\/10.1023\/A:1026421315292","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"412_CR2","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). \nhttps:\/\/doi.org\/10.1109\/TIT.2015.2473861","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"412_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2004.09.011","volume":"330","author":"C Ding","year":"2005","unstructured":"Ding, C., Wang, X.: A coding theory construction of new systematic authentication codes. Theor. Comput. Sci. 330(1), 81\u201399 (2005). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2004.09.011","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"412_CR4","doi-asserted-by":"publisher","first-page":"2477","DOI":"10.1109\/18.720545","volume":"44","author":"P Delsarte","year":"1998","unstructured":"Delsarte, P., Levenshtein, V. I.: Association schemes and coding theory. IEEE Trans. Inf. Theory 44(6), 2477\u20132504 (1998). \nhttps:\/\/doi.org\/10.1109\/18.720545","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"412_CR5","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":"6","key":"412_CR6","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). \nhttps:\/\/doi.org\/10.1109\/TIT.2015.2420118","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"412_CR7","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"},{"issue":"1","key":"412_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/LCOMM.2015.2497344","volume":"20","author":"C Tang","year":"2016","unstructured":"Tang, C., Qi, Y., Huang, D.: Two-weight and three-weight linear codes from square functions. IEEE Commun. Lett. 20(1), 29\u201332 (2016). \nhttps:\/\/doi.org\/10.1109\/LCOMM.2015.2497344","journal-title":"IEEE Commun. Lett."},{"issue":"9","key":"412_CR9","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1109\/LCOMM.2015.2455032","volume":"19","author":"Z Heng","year":"2015","unstructured":"Heng, Z., Yue, Q.: A class of binary linear codes with at most three weights. IEEE Commun. Lett. 19(9), 1488\u20131491 (2015). \nhttps:\/\/doi.org\/10.1109\/LCOMM.2015.2455032","journal-title":"IEEE Commun. Lett."},{"issue":"11","key":"412_CR10","doi-asserted-by":"publisher","first-page":"2832","DOI":"10.1016\/j.disc.2016.05.033","volume":"339","author":"Z Heng","year":"2016","unstructured":"Heng, Z., Yue, Q., Li, C.: Three classes of linear codes with two or three weights. Discret. Math. 339(11), 2832\u20132847 (2016). \nhttps:\/\/doi.org\/10.1016\/j.disc.2016.05.033","journal-title":"Discret. Math."},{"key":"412_CR11","doi-asserted-by":"crossref","unstructured":"Chang, S., Hyun, J. Y.: Linear codes from simplicial complexes. Linear codes from simplicial, pp. 1\u201315 (2017)","DOI":"10.1007\/s10623-017-0442-5"},{"key":"412_CR12","doi-asserted-by":"crossref","unstructured":"Ding, C., Heng, Z., Zhou, Z.: Minimal binary linear codes. IEEE Transactions on Information Theory (2018)","DOI":"10.1109\/TIT.2018.2819196"},{"issue":"2","key":"412_CR13","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 wmin\/wmax \u2264\u20091\/2. Appl. Algebra Eng. Commun. Comput. 30(2), 175\u2013184 (2019)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"7","key":"412_CR14","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":"412_CR15","doi-asserted-by":"crossref","unstructured":"Bonini, M., Borello, M.: Minimal linear codes arising from blocking sets. arXiv:\n1907.04626\n\n (2019)","DOI":"10.1007\/s10801-019-00930-6"},{"key":"412_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."},{"issue":"9","key":"412_CR17","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). \nhttps:\/\/doi.org\/10.1016\/j.disc.2016.03.029","journal-title":"Discret. Math."},{"key":"412_CR18","doi-asserted-by":"crossref","unstructured":"Li, C., Yue, Q., Fu, F. W.: A construction of several classes of two-weight and three-weight linear codes. Applicable Algebra in Engineering, Communication and Computing, pp. 1\u201320 (2016)","DOI":"10.1007\/s00200-016-0297-4"},{"key":"412_CR19","doi-asserted-by":"publisher","unstructured":"Mesnager, S.: Linear codes with few weights from weakly regular bent functions based on a generic construction. Cryptography and Communications, pp. 1\u201314. \nhttps:\/\/doi.org\/10.1007\/s12095-016-0186-5\n\n (2015)","DOI":"10.1007\/s12095-016-0186-5"},{"issue":"1","key":"412_CR20","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s12095-016-0199-0","volume":"9","author":"G Xu","year":"2017","unstructured":"Xu, G., Cao, X., Xu, S.: Two classes of p-ary bent functions and linear codes with three or four weights. Cryptogr. Commun. 9(1), 117\u2013131 (2017)","journal-title":"Cryptogr. Commun."},{"issue":"2","key":"412_CR21","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). \nhttps:\/\/doi.org\/10.1007\/s10623-015-0144-9","journal-title":"Des. Codes Cryptogr."},{"key":"412_CR22","doi-asserted-by":"crossref","unstructured":"Nyberg, K.: Perfect Nonlinear S-Boxes. In: Advances in Cryptology<a\u0331EUROCRYPT<\u200991, pp. 378\u2013386. Springer (1991)","DOI":"10.1007\/3-540-46416-6_32"},{"issue":"1","key":"412_CR23","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.ffa.2005.07.003","volume":"13","author":"C Carlet","year":"2007","unstructured":"Carlet, C., Ding, C.: Nonlinearities of S-boxes. Finite Fields Appl. 13(1), 121\u2013135 (2007)","journal-title":"Finite Fields Appl."},{"issue":"1","key":"412_CR24","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1011207501748","volume":"23","author":"T Wadayama","year":"2001","unstructured":"Wadayama, T., Hada, T., Wakasugi, K., Kasahara, M.: Upper and lower bounds on maximum nonlinearity of n-input m-output Boolean function. Des. Codes Crypt. 23(1), 23\u201334 (2001)","journal-title":"Des. Codes Crypt."},{"issue":"12","key":"412_CR25","doi-asserted-by":"publisher","first-page":"3055","DOI":"10.1016\/j.disc.2017.07.008","volume":"340","author":"D Tang","year":"2017","unstructured":"Tang, D., Carlet, C., Zhou, Z.: Binary linear codes from vectorial Boolean functions and their weight distribution. Discret. Math. 340(12), 3055\u20133072 (2017)","journal-title":"Discret. Math."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-019-00412-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-019-00412-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-019-00412-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T00:55:11Z","timestamp":1604710511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-019-00412-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,8]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["412"],"URL":"https:\/\/doi.org\/10.1007\/s12095-019-00412-3","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,8]]},"assertion":[{"value":"29 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}