{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T14:41:50Z","timestamp":1767969710688,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T00:00:00Z","timestamp":1620864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T00:00:00Z","timestamp":1620864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Slovenian Research Agency","doi-asserted-by":"crossref","award":["P1-0404"],"award-info":[{"award-number":["P1-0404"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61972400"],"award-info":[{"award-number":["61972400"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61872103"],"award-info":[{"award-number":["61872103"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s12095-021-00491-1","type":"journal-article","created":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T02:03:09Z","timestamp":1620871389000},"page":"637-659","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound"],"prefix":"10.1007","volume":"13","author":[{"given":"Enes","family":"Pasalic","sequence":"first","affiliation":[]},{"given":"Ren\u00e9","family":"Rodr\u00edguez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6804-6975","authenticated-orcid":false,"given":"Fengrong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yongzhuang","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,13]]},"reference":[{"key":"491_CR1","doi-asserted-by":"publisher","unstructured":"Alfarano, G. N., Borello, M., Neri, A.: A geometric characterization of minimal codes and their asymptotic performance. Advances in Mathematics of Communications. https:\/\/doi.org\/10.3934\/amc.2020104 (2020)","DOI":"10.3934\/amc.2020104"},{"issue":"5","key":"491_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"},{"issue":"7","key":"491_CR3","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":"491_CR4","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."},{"issue":"6","key":"491_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":"491_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."},{"key":"491_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, G., 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, Berlin (2013)","DOI":"10.1007\/978-3-642-45239-0_6"},{"issue":"6","key":"491_CR8","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":"491_CR9","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":"491_CR10","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":"491_CR11","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":"491_CR12","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 and their Applications 54, 176\u2013196 (2018)","journal-title":"Finite Fields and their Applications"},{"key":"491_CR13","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, 965\u2013986 (2020)","journal-title":"Cryptogr. Commun."},{"key":"491_CR14","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 wmin\/wmax <\u20091\/2 derived from Boolean functions. Des. Codes Cryptogr. 88, 257\u2013271 (2020)","journal-title":"Des. Codes Cryptogr."},{"key":"491_CR15","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., Cao, X.: The parameters of minimal codes. Finite Fields and Their Applications 71, 101799 (2021). https:\/\/doi.org\/10.1016\/j.ffa.2020.101799","journal-title":"Finite Fields and Their Applications"},{"key":"491_CR16","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, 71\u201384 (2017)","journal-title":"Cryptogr. Commun."},{"key":"491_CR17","unstructured":"Mesnager, S.: Linear codes from functions. In: Huffman, W. C., Kim, J., Sol\u00e9, P. (eds.) Concise Encyclopedia of Coding Theory, pp 463\u2013526. Chapman and Hall\/CRC, London, New York (2021)"},{"issue":"2-3","key":"491_CR18","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-3), 463\u2013480 (2019)","journal-title":"Des. Codes Crypt."},{"issue":"9","key":"491_CR19","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":"4","key":"491_CR20","doi-asserted-by":"publisher","first-page":"2296","DOI":"10.1109\/TIT.2019.2956130","volume":"66","author":"S Mesnager","year":"2020","unstructured":"Mesnager, S., S\u0131nak, A.: Several classes of minimal linear codes with few weights from weakly regular plateaued functions. IEEE Trans. Inf. Theory 66(4), 2296\u20132310 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"491_CR21","first-page":"77","volume":"8","author":"S Mesnager","year":"2019","unstructured":"Mesnager, S., S\u0131nak, A., Yayla, O.: Minimal linear codes with few weights and their secret sharing. Int. J. Inf. Secur. Sci 8(4), 77\u201387 (2019)","journal-title":"Int. J. Inf. Secur. Sci"},{"key":"491_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2016.12.001","volume":"222","author":"E Pasalic","year":"2017","unstructured":"Pasalic, E., Chattopadhyay, A., Chowdhury, D.: An analysis of root functions\u2014a subclass of the impossible class of faulty functions (ICFF). Discrete Appl. Math. 222, 1\u201313 (2017)","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"491_CR23","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1109\/LCOMM.2020.3014617","volume":"24","author":"Y Qi","year":"2020","unstructured":"Qi, Y., Yang, T., Dai, B.: Minimal linear codes from vectors with given weights. IEEE Commun. Lett. 24(12), 2674\u20132677 (2020)","journal-title":"IEEE Commun. Lett."},{"issue":"3","key":"491_CR24","doi-asserted-by":"publisher","first-page":"112215","DOI":"10.1016\/j.disc.2020.112215","volume":"344","author":"A S\u0131nak","year":"2021","unstructured":"S\u0131nak, A.: Minimal linear codes from weakly regular plateaued balanced functions. Discrete Mathematics 344(3), 112215 (2021). https:\/\/doi.org\/10.1016\/j.disc.2020.112215","journal-title":"Discrete Mathematics"},{"key":"491_CR25","unstructured":"Sorci, J.: Minimal codes from characteristic functions not satisfying the Ashikhmin-Barg condition. arXiv:1912.12769 (2019)"},{"issue":"3","key":"491_CR26","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":"491_CR27","doi-asserted-by":"publisher","unstructured":"Tang, C., Qiu, Y., Liao, Q., Zhou, Z.: Full characterization of minimal linear codes as cutting blocking sets. IEEE Trans. Inf. Theory. https:\/\/doi.org\/10.1109\/TIT.2021.3070377 (2021)","DOI":"10.1109\/TIT.2021.3070377"},{"key":"491_CR28","unstructured":"Wu, X., Lu, W., Cao, X.: Minimal linear codes constructed from functions. arXiv:1911.11632 (2019)"},{"issue":"11","key":"491_CR29","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":"491_CR30","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 and Their Applications 65, 101688 (2020). https:\/\/doi.org\/10.1016\/j.ffa.2020.101688","journal-title":"Finite Fields and Their Applications"},{"key":"491_CR31","unstructured":"Xu, G., Qu, L., Luo, G.: Minimal linear codes from weakly regular bent functions. The 11th International Conference on Sequences and Their Applications (SETA 2020), September 22\u201325, Saint Petersburg, Russia (2020)"},{"issue":"1","key":"491_CR32","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":"491_CR33","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_{{\\min \\limits }}\/w_{{\\max \\limits }}\\leq 1\/2$. Appl. Algebra Eng. Commun. Comput. 30, 75\u2013184 (2019)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"2","key":"491_CR34","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-00491-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-021-00491-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00491-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T05:40:50Z","timestamp":1633844450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-021-00491-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,13]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["491"],"URL":"https:\/\/doi.org\/10.1007\/s12095-021-00491-1","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,13]]},"assertion":[{"value":"9 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}