{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:46:12Z","timestamp":1757310372771,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"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":["U1705264; 61572132"],"award-info":[{"award-number":["U1705264; 61572132"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"crossref","award":["2019J01275"],"award-info":[{"award-number":["2019J01275"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100009558","name":"University Natural Science Research Project of Anhui Province","doi-asserted-by":"publisher","award":["KJ2018A0584"],"award-info":[{"award-number":["KJ2018A0584"]}],"id":[{"id":"10.13039\/501100009558","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s12095-021-00531-w","type":"journal-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T16:02:17Z","timestamp":1636819337000},"page":"1025-1041","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Secret sharing schemes based on the dual of Golay codes"],"prefix":"10.1007","volume":"13","author":[{"given":"Jian","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2868-3398","authenticated-orcid":false,"given":"Changlu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sihem","family":"Mesnager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"issue":"5","key":"531_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"},{"issue":"7","key":"531_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":"531_CR3","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the national computer conference\u201979, AFIPS Proceedings, vol. 48, pp 313\u2013317 (1979)"},{"issue":"2","key":"531_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.3934\/amc.2011.5.191","volume":"5","author":"S Bouyuklieva","year":"2011","unstructured":"Bouyuklieva, S., Varbanov, Z.: Some connections between self-dual codes, combinatorial designs and secret sharing schemes. Adv. Math. Commun. 5(2), 191\u2013198 (2011)","journal-title":"Adv. Math. Commun."},{"issue":"6","key":"531_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 perfect nonlinear mappings and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089\u20132102 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"531_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.Y.: Linear codes from simplicial complexes. Des. Codes Cryptogr. 86(10), 2167\u20132181 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"531_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, G.D., Mesnager, S., Patey, A. Stam, M. (ed.): On minimal and quasi-minimal linear codes, vol. 8308. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-45239-0_6"},{"key":"531_CR8","doi-asserted-by":"crossref","unstructured":"Ding, C., Yuan, J. Calude, C.S., Dinneen, M. J., Vajnovszki, V. (eds.): Covering and Secret Sharing with Linear Codes, vol. 2731. Springer, Berlin (2003)","DOI":"10.1007\/3-540-45066-1_2"},{"issue":"10","key":"531_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. Inf. Theory 64(10), 6536\u20136545 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1,2","key":"531_CR10","first-page":"51","volume":"72","author":"C Ding","year":"2006","unstructured":"Ding, C., Salomaa, A.: Secret sharing schemes with nice access structures. Fundam. Inform. 72(1,2), 51\u201363 (2006)","journal-title":"Fundam. Inform."},{"key":"531_CR11","doi-asserted-by":"crossref","unstructured":"Dougherty, S.T., Mesnager, S., Sol\u00e9, P.: Secret-sharing schemes based on self-dual codes. In: 2008 IEEE information theory workshop, pp 338\u2013342 (2008)","DOI":"10.1109\/ITW.2008.4578681"},{"key":"531_CR12","unstructured":"Golay, M.J.E.: Notes on digital coding. In: Proceedings of the IRE, vol. 37, p 637 (1949)"},{"key":"531_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of error-correcting codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of error-correcting codes. Cambridge University Press, Cambridge (2003)"},{"issue":"1","key":"531_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF02620229","volume":"6","author":"M Ito","year":"1993","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Multiple assignment scheme for sharing secret. J. Cryptol. 6(1), 15\u201320 (1993)","journal-title":"J. Cryptol."},{"issue":"5","key":"531_CR15","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."},{"key":"531_CR16","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland Publishing company, Amsterdam (1977)"},{"key":"531_CR17","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of 6th joint swedish russian workshop on information theory, pp. 276\u2013279 (1993)"},{"key":"531_CR18","unstructured":"Massey, J.L.: Some applications of coding theory in cryptography, codes and ciphers. Cryptography and Coding IV, Formara Ltd, Esses England 33\u201347 (1995)"},{"issue":"9","key":"531_CR19","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"RJ McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Comm. ACM 24(9), 583\u2013584 (1981)","journal-title":"Comm. ACM"},{"issue":"1","key":"531_CR20","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":"531_CR21","unstructured":"Mesnager, S. In: Huffman, W.C., Kim, J.-L., Sol\u00e9, P. (eds.) : Linear Codes from Functions A Concise Encyclopedia of Coding Theory Chapter 20. CRC Press\/Taylor and Francis Group (Publisher), London (2021)"},{"key":"531_CR22","unstructured":"Mesnager, S., \u00d6zbudak, F., S\u0131nak, A.: A new class of three-weight linear codes from weakly regular plateaued functions. In: Proceedings of the Tenth International Workshop on Coding and Cryptography (WCC 2017) (2017)"},{"issue":"2-3","key":"531_CR23","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 Cryptogr. 87(2-3), 463\u2013480 (2019)","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"531_CR24","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":"3","key":"531_CR25","first-page":"44","volume":"8","author":"A S\u0131nak","year":"2019","unstructured":"Mesnager. S., S\u0131nak, A., Yayla, O.: Minimal linear codes with few weights and their Secret Sharing. International Journal of Information Security Science Springer 8(3), 44\u201352 (2019)","journal-title":"International Journal of Information Security Science Springer"},{"issue":"11","key":"531_CR26","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"531_CR27","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s12095-016-0206-5","volume":"95","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. 95, 637\u2013646 (2017)","journal-title":"Cryptogr. Commun."},{"issue":"6","key":"531_CR28","doi-asserted-by":"publisher","first-page":"111840","DOI":"10.1016\/j.disc.2020.111840","volume":"343","author":"Z Shi","year":"2020","unstructured":"Shi, Z., Fu, F.: Several families of q-ary minimal linear codes with $w_{\\min \\limits }\/w_{\\max \\limits }\\leq (q-1)\/q$. Discrete Math. 343(6), 111840 (2020)","journal-title":"Discrete Math."},{"issue":"3","key":"531_CR29","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. Discret. Math. 344(3), 112215 (2021)","journal-title":"Discret. Math."},{"key":"531_CR30","doi-asserted-by":"crossref","unstructured":"Su, S., Li, P.: Photoacoustic Signal Generation with Golay Coded Excitation. In: 2010 IEEE International Ultrasonics Symposium. pp. 2151-2154 (2010)","DOI":"10.1109\/ULTSYM.2010.5935811"},{"issue":"1","key":"531_CR31","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"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00531-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-021-00531-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00531-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T15:12:36Z","timestamp":1637680356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-021-00531-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["531"],"URL":"https:\/\/doi.org\/10.1007\/s12095-021-00531-w","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2021,11]]},"assertion":[{"value":"20 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}