{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:35:09Z","timestamp":1769315709675,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:00:00Z","timestamp":1635206400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:00:00Z","timestamp":1635206400000},"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":["61722213"],"award-info":[{"award-number":["61722213"]}],"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":"crossref","award":["11771007"],"award-info":[{"award-number":["11771007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11601177"],"award-info":[{"award-number":["11601177"]}],"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":[[2022,3]]},"DOI":"10.1007\/s12095-021-00519-6","type":"journal-article","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T14:02:37Z","timestamp":1635256957000},"page":"415-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Minimal linear codes from weakly regular bent functions"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3180-6969","authenticated-orcid":false,"given":"Guangkui","family":"Xu","sequence":"first","affiliation":[]},{"given":"Longjiang","family":"Qu","sequence":"additional","affiliation":[]},{"given":"Gaojun","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,26]]},"reference":[{"issue":"5","key":"519_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. Inform. Theory 44(5), 2010\u20132017 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"519_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":"519_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":"519_CR4","doi-asserted-by":"crossref","unstructured":"Chabanne, H., Cohen, G., Patey, A.: Towards secure two-party computation from the wiretap channel. In: Information Security and Cryptology-ICISC 2013, pp 34\u201346. Springer, Berlin (2013)","DOI":"10.1007\/978-3-319-12160-4_3"},{"issue":"10","key":"519_CR5","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1007\/s10623-017-0442-5","volume":"86","author":"S Chang","year":"2017","unstructured":"Chang, S., Hyun, J.Y.: Linear codes from simplicial complexes. Des. Codes Cryptogr. 86(10), 2167\u20132181 (2017)","journal-title":"Des. Codes Cryptogr."},{"key":"519_CR6","doi-asserted-by":"crossref","unstructured":"Ding, C., Yuan, J.: Covering and secret sharing with linear codes. In: Calude, C.S., et al (eds.) Discrete Mathematics and Theoretical Computer Science. Lecture Notes in Computer Science, vol. 2731, pp 11\u201325. Springer, Berlin (2003)","DOI":"10.1007\/3-540-45066-1_2"},{"issue":"6","key":"519_CR7","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":"519_CR8","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."},{"issue":"10","key":"519_CR9","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. Inform. Theory 64(10), 6536\u20136545 (2018)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"519_CR10","doi-asserted-by":"publisher","first-page":"2018","DOI":"10.1109\/TIT.2006.872854","volume":"52","author":"T Helleseth","year":"2006","unstructured":"Helleseth, T., Kholosha, A.: Monomial and quadratic bent functions over the finite fields of odd characteristic. IEEE Trans. Inf. Theory 52(5), 2018\u20132032 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"519_CR11","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."},{"key":"519_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 Appl. 54, 176\u2013196 (2018)","journal-title":"Finite Fields Appl."},{"key":"519_CR13","volume-title":"Finite fields in Encyclopedia of Mathematics, vol. 20","author":"R Lidl","year":"1983","unstructured":"Lidl, R., Niederreiter, H.: Finite fields in Encyclopedia of Mathematics, vol. 20. Cambridge University Press, Cambridge (1983)"},{"key":"519_CR14","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 linear codes. Finite Fields Appl. 71, 101799 (2021)","journal-title":"Finite Fields Appl."},{"issue":"6","key":"519_CR15","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1007\/s12095-017-0272-3","volume":"10","author":"G Luo","year":"2018","unstructured":"Luo, G., Cao, X.: Five classes of optimal two-weight linear codes. Cryptogr. Commun. 10(6), 1119\u20131135 (2018)","journal-title":"Cryptogr. Commun."},{"key":"519_CR16","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pp 276\u2013279, M\u00f6lle (1993)"},{"issue":"1","key":"519_CR17","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."},{"issue":"2-3","key":"519_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., \u00f6zbudak, F., Sinak, A.: Linear codes from weakly regular plateaued functions and their secret sharing schemes. Des. Codes Cryptogr. 87(2-3), 463\u2013480 (2019)","journal-title":"Des. Codes Cryptogr."},{"issue":"9","key":"519_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":"5","key":"519_CR20","first-page":"729","volume":"50","author":"M Shi","year":"2013","unstructured":"Shi, M., Zhu, S., Yang, S.: A class of optimal p-ary codes from one-weight codes over $\\mathbb {F}_{p}[u]\/\\langle u^{m}\\rangle $. J. Frankl. Inst. 50(5), 729\u2013737 (2013)","journal-title":"J. Frankl. Inst."},{"key":"519_CR21","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}_{2}+u\\mathbb {F}_{2}$. IEEE Commun. Lett. 20, 2346\u20132349 (2016)","journal-title":"IEEE Commun. Lett."},{"issue":"10","key":"519_CR22","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":"519_CR23","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.dam.2016.09.050","volume":"219","author":"M Shi","year":"2017","unstructured":"Shi, M., Liu, Y., Sol\u00e9, P.: Optimal binary codes from trace codes over a non-chain ring. Discret. Appl. Math. 219, 176\u2013181 (2017)","journal-title":"Discret. Appl. Math."},{"key":"519_CR24","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s00200-017-0345-8","volume":"29","author":"M Shi","year":"2018","unstructured":"Shi, M., Qian, L., Sol\u00e9, P.: Few-weight codes from trace codes over a local ring. Appl. Algebra Eng. Commun. Comput. 29, 335\u2013350 (2018)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"519_CR25","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s12095-016-0206-5","volume":"9","author":"M Shi","year":"2017","unstructured":"Shi, M., Wu, R., Liu, Y., Sol\u00e9, P.: Two and three weight codes over $\\mathbb {F}_{p}+u\\mathbb {F}_{p}$. Cryptogr. Commun. 9, 637\u2013646 (2017)","journal-title":"Cryptogr. Commun."},{"issue":"3","key":"519_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, 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":"6","key":"519_CR27","doi-asserted-by":"publisher","first-page":"3690","DOI":"10.1109\/TIT.2021.3070377","volume":"67","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 67(6), 3690\u20133700 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"519_CR28","doi-asserted-by":"publisher","first-page":"3724","DOI":"10.1109\/TIT.2021.3067049","volume":"67","author":"R Tao","year":"2021","unstructured":"Tao, R., Feng, T., Li, W.: A construction of minimal linear codes from partial difference sets. IEEE Trans. Inf. Theory 67(6), 3724\u20133734 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"519_CR29","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":"519_CR30","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":"11","key":"519_CR31","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":"519_CR32","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":"3","key":"519_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."},{"issue":"2","key":"519_CR34","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 $ w_{\\min \\limits }\/w_{\\max \\limits }\\le 1\/2$. Appl. Algebra Eng. Commun. Comput. 30(2), 175\u2013184 (2019)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"2","key":"519_CR35","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-00519-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-021-00519-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00519-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T07:15:53Z","timestamp":1646291753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-021-00519-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,26]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["519"],"URL":"https:\/\/doi.org\/10.1007\/s12095-021-00519-6","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,26]]},"assertion":[{"value":"16 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}