{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:55:13Z","timestamp":1776956113965,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T00:00:00Z","timestamp":1599782400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T00:00:00Z","timestamp":1599782400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10623-020-00793-0","type":"journal-article","created":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T17:02:58Z","timestamp":1599843778000},"page":"2475-2492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Optimal minimal linear codes from posets"],"prefix":"10.1007","volume":"88","author":[{"given":"Jong Yoon","family":"Hyun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyun Kwang","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yansheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2873-5549","authenticated-orcid":false,"given":"Qin","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,11]]},"reference":[{"key":"793_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":"793_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, 4152\u20134155 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"793_CR3","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":"793_CR4","doi-asserted-by":"crossref","unstructured":"Chabanne H., Cohen G., Patey A.: Towards secure two-party computation from the wire-tap channel, in: Proceedings of ICISC 2013(Lecture Notes in Computer Science, vol. 8565), H.-S. Lee and D.-G. Han Eds. Berlin: Springer-Verlag, 34-46 (2014)","DOI":"10.1007\/978-3-319-12160-4_3"},{"key":"793_CR5","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":"793_CR6","doi-asserted-by":"crossref","unstructured":"Cohen G., Mesnager S., Patey A.: On minimal and quasi-minimal linear codes, in: Proceedings of IMACC (Lecture Notes in Computer Science, vol. 8308), M. Stam, Eds. Berlin: Springer-Verlag, 85-98 (2003)","DOI":"10.1007\/978-3-642-45239-0_6"},{"key":"793_CR7","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, 2288\u20132303 (2016).","journal-title":"Discret. Math."},{"key":"793_CR8","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":"793_CR9","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 2731, Springer Verlag, 11-25 (2003)","DOI":"10.1007\/3-540-45066-1_2"},{"key":"793_CR10","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes. http:\/\/www.codetables.de."},{"key":"793_CR11","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"JH Griesmer","year":"1960","unstructured":"Griesmer J.H.: A bound for error correcting codes. IBM J. Res. Dev. 4, 532\u2013542 (1960).","journal-title":"IBM J. Res. Dev."},{"key":"793_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":"793_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)."},{"key":"793_CR14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2993179","author":"JY Hyun","year":"2020","unstructured":"Hyun J.Y., Lee J., Lee Y.: Infinite families of optimal linear codes constructed from simplicial complexes. IEEE Trans. Inf. Theory (2020). https:\/\/doi.org\/10.1109\/TIT.2020.2993179.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"793_CR15","doi-asserted-by":"publisher","first-page":"3166","DOI":"10.1016\/j.disc.2019.06.025","volume":"342","author":"X Kong","year":"2019","unstructured":"Kong X., Yang S.: Complete weight enumerators of a class of linear codes with two or three weights. Discret. Math. 342(11), 3166\u20133176 (2019).","journal-title":"Discret. Math."},{"key":"793_CR16","unstructured":"Massey J. L.: Minimal codewords and secret sharing, in: Proc. 6th Joint Swedish-Russian Workshop on Information Theory, M\u00f6lle, Sweden, 246-249 (1993)."},{"key":"793_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, 71\u201384 (2017).","journal-title":"Cryptogr. Commun."},{"key":"793_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1011207501748","volume":"23","author":"T Wadayama","year":"2001","unstructured":"Wadayama T., Hada T., Wakasugi K., Kasahara M.: Upper and lower bounds on maximum nonlinearity of $$n$$-input $$m$$-output Boolean function. Des. Codes Cryptogr. 23, 23\u201333 (2001).","journal-title":"Des. Codes Cryptogr."},{"key":"793_CR19","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"},{"key":"793_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.dam.2020.01.019","volume":"283","author":"Y Wu","year":"2020","unstructured":"Wu Y., Hyun J.Y.: Few-weight codes over $$F_p+uF_p$$ associated with down sets and their distance optimal Gray image. Discret. Appl. Math. 283, 315\u2013322 (2020).","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"793_CR21","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1109\/LCOMM.2020.2982381","volume":"24","author":"Y Wu","year":"2020","unstructured":"Wu Y., Lee Y.: Binary LCD and self-orthogonal codes via simplicial complexes. IEEE Commun. Lett. 24(6), 1159\u20131162 (2020).","journal-title":"IEEE Commun. Lett."},{"key":"793_CR22","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/j.disc.2018.10.035","volume":"342","author":"Y Wu","year":"2019","unstructured":"Wu Y., Yue Q., Zhu X., Yang S.: Weight enumerators of reducible cyclic codes and their dual codes. Discret. Math. 342, 671\u2013682 (2019).","journal-title":"Discret. Math."},{"issue":"6","key":"793_CR23","doi-asserted-by":"publisher","first-page":"3657","DOI":"10.1109\/TIT.2019.2946840","volume":"66","author":"Y Wu","year":"2020","unstructured":"Wu Y., Zhu X., Yue Q.: Optimal few-weight codes from simplicial complexes. IEEE Trans. Inf. Theory 66(6), 3657\u20133663 (2020).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00793-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-020-00793-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00793-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T23:53:20Z","timestamp":1631318000000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-020-00793-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,11]]},"references-count":23,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["793"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00793-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,11]]},"assertion":[{"value":"19 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}