{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T07:35:29Z","timestamp":1778225729232,"version":"3.51.4"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2017,11,24]],"date-time":"2017-11-24T00:00:00Z","timestamp":1511481600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2014R1A1A2A10054745"],"award-info":[{"award-number":["2014R1A1A2A10054745"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Science","award":["NRF-2013R1A1A2062121"],"award-info":[{"award-number":["NRF-2013R1A1A2062121"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10623-017-0442-5","type":"journal-article","created":{"date-parts":[[2017,11,23]],"date-time":"2017-11-23T23:27:39Z","timestamp":1511479659000},"page":"2167-2181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":98,"title":["Linear codes from simplicial complexes"],"prefix":"10.1007","volume":"86","author":[{"given":"Seunghwan","family":"Chang","sequence":"first","affiliation":[]},{"given":"Jong Yoon","family":"Hyun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,24]]},"reference":[{"key":"442_CR1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.4169\/amer.math.monthly.122.04.367","volume":"122","author":"M Adamaszek","year":"2015","unstructured":"Adamaszek M.: Face numbers of down-sets. Am. Math. Mon. 122, 367\u2013370 (2015).","journal-title":"Am. Math. Mon."},{"key":"442_CR2","doi-asserted-by":"crossref","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":"442_CR3","first-page":"313","volume":"48","author":"GR Blakley","year":"1979","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. Proc. AFIPS Natl Comput. Conf. 48, 313\u2013317 (1979).","journal-title":"Proc. AFIPS Natl Comput. Conf."},{"key":"442_CR4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.ffa.2005.07.003","volume":"13","author":"C Carlet","year":"2007","unstructured":"Carlet C., Ding C.: Nonlinearities of S-boxes. Finite Field Appl. 13, 121\u2013135 (2007).","journal-title":"Finite Field Appl."},{"key":"442_CR5","doi-asserted-by":"crossref","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, 2089\u20132102 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"442_CR6","doi-asserted-by":"crossref","unstructured":"Cohen G.D., S. Mesnager S., Patey, A.: On minimal and quasi-minimal linear codes, Cryptography and coding. Lecture Notes In: IMA International Conference on Cryptography and Coding, vol. 8308, pp. 85\u201398. Springer, Heidelberg (2013).","DOI":"10.1007\/978-3-642-45239-0_6"},{"key":"442_CR7","doi-asserted-by":"crossref","first-page":"5835","DOI":"10.1109\/TIT.2015.2473861","volume":"61","author":"K Ding","year":"2015","unstructured":"Ding K., Ding C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 61, 5835\u20135842 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"442_CR8","unstructured":"Ding C., Yuan J.: Covering and secret sharing with linear codes, Discrete mathematics and theoretical computer science. Lecture Notes In: Computer Science, vol. 2731, pp. 11\u201325. Springer, Berlin (2003)."},{"key":"442_CR9","doi-asserted-by":"crossref","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":"442_CR10","doi-asserted-by":"crossref","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                        $$n$$\n                        \n                            \n                                n\n                            \n                        \n                    -input \n                        $$m$$\n                        \n                            \n                                m\n                            \n                        \n                    -output Boolean function. Des. Codes Cryptogr. 23, 23\u201333 (2001).","journal-title":"Des. Codes Cryptogr."},{"key":"442_CR11","doi-asserted-by":"crossref","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":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-017-0442-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0442-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0442-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T14:04:27Z","timestamp":1534773867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-017-0442-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,24]]},"references-count":11,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["442"],"URL":"https:\/\/doi.org\/10.1007\/s10623-017-0442-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,24]]}}}