{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T02:52:51Z","timestamp":1769309571842,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T00:00:00Z","timestamp":1702425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T00:00:00Z","timestamp":1702425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"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":["12171241"],"award-info":[{"award-number":["12171241"]}],"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":[[2024,5]]},"DOI":"10.1007\/s12095-023-00689-5","type":"journal-article","created":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T08:02:19Z","timestamp":1702454539000},"page":"601-611","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Minimal linear codes constructed from partial spreads"],"prefix":"10.1007","volume":"16","author":[{"given":"Xia","family":"Wu","sequence":"first","affiliation":[]},{"given":"Wei","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Xiwang","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Gaojun","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,13]]},"reference":[{"key":"689_CR1","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1007\/s10623-022-01029-z","volume":"90","author":"N Anbar","year":"2022","unstructured":"Anbar, N., Meidl, W.: Bent partitions. Des. Codes Cryptogr. 90, 1081\u20131101 (2022)","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"689_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"},{"key":"689_CR3","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"},{"issue":"1","key":"689_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.3934\/amc.2020104","volume":"16","author":"GN Alfarano","year":"2022","unstructured":"Alfarano, G.N., Borello, M., Neri, A.: A geometric characterization of minimal codes and their asymptotic performance. Adv. Math. Commun. 16(1), 115\u2013133 (2022)","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"689_CR5","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1137\/21M1391493","volume":"36","author":"GN Alfarano","year":"2022","unstructured":"Alfarano, G.N., Borello, M., Neri, A., Ravagnani, A.: Three combinatorial perspectives on minimal codes. Siam J. Discrete Math. 36(1), 461\u2013489 (2022)","journal-title":"Siam J. Discrete Math."},{"issue":"7","key":"689_CR6","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":"689_CR7","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s12095-021-00474-2","volume":"13","author":"D Bartoli","year":"2021","unstructured":"Bartoli, D., Bonini, M., Gunes, B.: An inductive construction of minimal codes. Cryptogr. Commun. 13(3), 439\u2013449 (2021)","journal-title":"Cryptogr. Commun."},{"issue":"2","key":"689_CR8","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1515\/forum-2020-0338","volume":"34","author":"D Bartoli","year":"2022","unstructured":"Bartoli, D., Cossidente, A., Marino, G., Pavese, F.: On cutting blocking sets and their codes. Forum Math. 34(2), 347\u2013368 (2022)","journal-title":"Forum Math."},{"issue":"3","key":"689_CR9","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"},{"issue":"2","key":"689_CR10","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(2), 327\u2013341 (2021)","journal-title":"J. Algebraic Comb."},{"issue":"2","key":"689_CR11","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":"689_CR12","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":"689_CR13","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-46. Springer-Verlag, Berlin (2014)","DOI":"10.1007\/978-3-319-12160-4_3"},{"key":"689_CR14","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"},{"key":"689_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.ffa.2016.12.009","volume":"45","author":"C Ding","year":"2017","unstructured":"Ding, C., Fan, C., Zhou, Z.: The dimension and minimum distance of two classes of primitive BCH codes. Finite Fields Appl. 45, 237\u2013263 (2017)","journal-title":"Finite Fields Appl."},{"issue":"10","key":"689_CR16","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"},{"key":"689_CR17","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"},{"key":"689_CR18","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":"689_CR19","doi-asserted-by":"crossref","unstructured":"H\u00e9ger, T., Nagy, Z.L.: Short minimal codes and covering codes via strong blocking sets in projective spaces. IEEE Trans. Inf. Theory 68(2), 881\u2013890 (2022)","DOI":"10.1109\/TIT.2021.3123730"},{"key":"689_CR20","doi-asserted-by":"crossref","unstructured":"Kantor, W.M.: On maximal symplectic partial spreads. Advances in Geometry 17(4), 453\u2013471 (2017)","DOI":"10.1515\/advgeom-2017-0033"},{"key":"689_CR21","doi-asserted-by":"publisher","first-page":"176","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, 176\u2013196 (2021)","journal-title":"Finite Fields Appl."},{"key":"689_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-021-00960-x","volume":"90","author":"X Li","year":"2022","unstructured":"Li, X., Yue, Q., Tang, D.: A family of linear codes from constant dimension subspace codes. Des. Codes Cryptogr. 90, 1\u201315 (2022)","journal-title":"Des. Codes Cryptogr."},{"key":"689_CR23","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proc. 6th joint Swedish-Russian workshop on information theory (M$$\\ddot{o}$$lle, Sweden), pp. 246\u2013249 (1993)"},{"issue":"6","key":"689_CR24","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":"689_CR25","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"},{"key":"689_CR26","doi-asserted-by":"publisher","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":"689_CR27","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":"689_CR28","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":"10","key":"689_CR29","doi-asserted-by":"publisher","first-page":"4120","DOI":"10.1109\/TCOMM.2013.072213.130107","volume":"61","author":"Z Zhou","year":"2013","unstructured":"Zhou, Z., Ding, C.: Seven classes of three-weight cyclic codes. In IEEE Trans. Commun. 61(10), 4120\u20134126 (2013)","journal-title":"In IEEE Trans. Commun."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00689-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-023-00689-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00689-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T09:13:29Z","timestamp":1713863609000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-023-00689-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,13]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["689"],"URL":"https:\/\/doi.org\/10.1007\/s12095-023-00689-5","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,13]]},"assertion":[{"value":"25 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}