{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:47:12Z","timestamp":1756993632125,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T00:00:00Z","timestamp":1614384000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T00:00:00Z","timestamp":1614384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002081","name":"Irish Research Council","doi-asserted-by":"publisher","award":["GOIPD\/2020\/597"],"award-info":[{"award-number":["GOIPD\/2020\/597"]}],"id":[{"id":"10.13039\/501100002081","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,5]]},"DOI":"10.1007\/s12095-021-00474-2","type":"journal-article","created":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T17:03:11Z","timestamp":1614445391000},"page":"439-449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An inductive construction of minimal codes"],"prefix":"10.1007","volume":"13","author":[{"given":"Daniele","family":"Bartoli","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9326-1370","authenticated-orcid":false,"given":"Matteo","family":"Bonini","sequence":"additional","affiliation":[]},{"given":"Bur\u00e7in","family":"G\u00fcne\u015f","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,27]]},"reference":[{"key":"474_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, 2010\u20132017 (1998)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"474_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. Inform. Theory. 65, 4152\u20134155 (2019)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"474_CR3","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. Inform. Theory. 24, 384\u2013386 (1978)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"474_CR4","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proc. of AFIPS National Computer Conference, pp. 313\u2013317. New York (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"474_CR5","doi-asserted-by":"publisher","unstructured":"Bonini, M., Borello, M.: Minimal linear codes arising from blocking sets. J. Algebr. Comb. https:\/\/doi.org\/10.1007\/s10801-019-00930-6 (2020)","DOI":"10.1007\/s10801-019-00930-6"},{"key":"474_CR6","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, 2089\u20132102 (2005)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"474_CR7","doi-asserted-by":"crossref","unstructured":"Chabanne, H., Cohen, G., Patey, A.: Towards secure two-party computation from the wire-tap channel. In: Information Security and Cryptology \u2013 ICISC 2013, pp. 34\u201346. Heidelberg (2014)","DOI":"10.1007\/978-3-319-12160-4_3"},{"key":"474_CR8","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, 2167\u20132181 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"474_CR9","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. Inform. Theory. 36, 381\u2013385 (1990)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"474_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, G.D., Mesnager, S., Patey, A.: On minimal and quasi-minimal linear codes. In: IMACC 2013 pp. 85\u201398. Heidelberg (2013)","DOI":"10.1007\/978-3-642-45239-0_6"},{"key":"474_CR11","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1109\/TIT.2015.2420118","volume":"60","author":"C Ding","year":"2015","unstructured":"Ding, C.: Linear codes from some 2-designs. IEEE Trans. Inf. Theory. 60, 3265\u20133275 (2015)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"474_CR12","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, 6536\u20136545 (2018)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"474_CR13","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.disc.2015.09.001","volume":"339","author":"C Ding","year":"2016","unstructured":"Ding, C., Li, N., Li, C., Zhou, Z.: Three-weight cyclic codes and their weight distributions. Discrete Math. 339, 415\u2013427 (2016)","journal-title":"Discrete Math."},{"key":"474_CR14","doi-asserted-by":"crossref","unstructured":"Ding, C., Yuan, J.: Covering and secret sharing with linear codes. In: DMTCS 2003, pp.11\u201325. Heidelberg (2003)","DOI":"10.1007\/3-540-45066-1_2"},{"key":"474_CR15","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":"474_CR16","volume-title":"Codes for Error Detection Series on Coding Theory and Cryptology, vol. 2","author":"T Klove","year":"2007","unstructured":"Klove, T.: Codes for Error Detection Series on Coding Theory and Cryptology, vol. 2. World Scientific Publishing Co. Pte. Ltd., Hackensack (2007)"},{"key":"474_CR17","unstructured":"Massey, J.L.: Minimal codewords and secret sharing (1993)"},{"key":"474_CR18","unstructured":"Massey, J.L.: Some applications of coding theory in cryptography. In Codes and Cyphers: Cryptography and Coding IV, pp. 33\u201347. Esses (1995)"},{"key":"474_CR19","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, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"474_CR20","unstructured":"Song, Y., Li, Z.: Secret sharing with a class of minimal linear codes. arXiv:https:\/\/arxiv.org\/abs\/1202.4058 (2012). Accessed 20 October 2020"},{"key":"474_CR21","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, 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-00474-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-021-00474-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00474-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,12]],"date-time":"2021-05-12T11:35:14Z","timestamp":1620819314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-021-00474-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,27]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["474"],"URL":"https:\/\/doi.org\/10.1007\/s12095-021-00474-2","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2021,2,27]]},"assertion":[{"value":"10 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}