{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T02:42:47Z","timestamp":1765593767203,"version":"3.48.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s11424-025-3313-6","type":"journal-article","created":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T02:39:00Z","timestamp":1765593540000},"page":"2721-2731","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Family of Minimal Linear Codes from Simplicial Complexes"],"prefix":"10.1007","volume":"38","author":[{"given":"Xianglin","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minjia","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huizhou","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,13]]},"reference":[{"issue":"6","key":"3313_CR1","doi-asserted-by":"publisher","first-page":"2229","DOI":"10.1109\/TIT.2007.896872","volume":"53","author":"C Ding","year":"2007","unstructured":"Ding C, Helleseth T, Klove T, et al., A general construction of Cartesian authentication codes, IEEE Trans. Inf. Theory, 2007, 53(6): 2229\u20132235.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3313_CR2","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1109\/LCOMM.2015.2455032","volume":"19","author":"Z Heng","year":"2015","unstructured":"Heng Z and Yue Q, A class of binary linear codes with at most three weights, IEEE Commun. Letters, 2015, 19): 1488\u20131491.","journal-title":"IEEE Commun. Letters"},{"key":"3313_CR3","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ffa.2014.01.009","volume":"28","author":"C Li","year":"2014","unstructured":"Li C, Yue Q, and Li F, Weight distributions of cyclic codes with respect to pairwise coprime order elements, Finite Fields Appl., 2014, 28): 94\u2013114.","journal-title":"Finite Fields Appl."},{"key":"3313_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s12095-017-0277-y","volume":"11","author":"H Liu","year":"2019","unstructured":"Liu H and Maouche Y, Several new classes of linear codes with few weights, Cryptogr. Commun., 2019, 11): 137\u2013146.","journal-title":"Cryptogr. Commun."},{"issue":"6","key":"3313_CR5","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1109\/TIT.2007.896886","volume":"53","author":"C Ding","year":"2007","unstructured":"Ding C and Niederreiter H, Cyclotomic linear codes of order 3, IEEE Trans. Inf. Theory, 2007, 53(6): 2274\u20132277.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"3313_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1026421315292","volume":"15","author":"A R Anderson","year":"1998","unstructured":"Anderson A R, Ding C, Helleseth T, et al., How to build robust shared control systems, Des. Codes Cryptogr., 1998, 15(2): 111\u2013124.","journal-title":"Des. Codes Cryptogr."},{"issue":"6","key":"3313_CR7","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, and Yuan J, Linear codes from perfect nonlinear mappings and their secret sharing schemes, IEEE Trans. Inf. Theory, 2005, 51(6): 2089\u20132102.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"3313_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12190-022-01736-9","volume":"69","author":"S Li","year":"2023","unstructured":"Li S and Shi M, Two infinite families of two-weight codes over \u21242m, J. Appl. Math. Comput., 2023, 69(1): 201\u2013218.","journal-title":"J. Appl. Math. Comput."},{"issue":"12","key":"3313_CR9","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1007\/s10623-020-00796-x","volume":"88","author":"M Shi","year":"2020","unstructured":"Shi M, Wang X, and Sol\u00e9 P, Two families of two-weight codes over \u21244, Des. Codes Cryptogr., 2020, 88(12): 2493\u20132505.","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"3313_CR10","doi-asserted-by":"publisher","first-page":"2696","DOI":"10.1109\/TIT.2019.2891562","volume":"65","author":"H Liu","year":"2019","unstructured":"Liu H and Maouche Y, Two or few-weight trace codes over $${\\mathbb F}_{{q}} + u{\\mathbb F}_{{q}}$$, IEEE Trans. Inf. Theory, 2019, 65(5): 2696\u20132703.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"3313_CR11","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/s11424-016-5062-z","volume":"30","author":"M Shi","year":"2017","unstructured":"Shi M, Luo Y, and Sol\u00e9 P, Construction of one-Lee weight and two-Lee weight codes over $${\\mathbb F}_{{p}} + v{\\mathbb F}_{{p}}$$, Journal of Systems Science & Complexity, 2017, 30(2): 484\u2013493.","journal-title":"Journal of Systems Science & Complexity"},{"issue":"3","key":"3313_CR12","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s11424-015-3265-3","volume":"28","author":"M Shi","year":"2015","unstructured":"Shi M and Sol\u00e9 P, Optimal p-ary codes from one-weight and two-weight codes over $${\\mathbb F}_{{p}} + v{\\mathbb F}_{{p}}$$, Journal of Systems Science & Complexity, 2015, 28(3): 679\u2013690.","journal-title":"Journal of Systems Science & Complexity"},{"key":"3313_CR13","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1016\/j.disc.2017.09.003","volume":"341","author":"Y Liu","year":"2018","unstructured":"Liu Y, Shi M, and Sol\u00e9 P, Two-weight and three-weight codes from trace codes over $${\\mathbb F}_{{p}} + u{\\mathbb F}_{{p}} + v{\\mathbb F}_{{p}} + uv{\\mathbb F}_{{p}}$$, Disc. Math., 2018, 341): 350\u2013357.","journal-title":"Disc. Math."},{"issue":"6","key":"3313_CR14","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1109\/TIT.2015.2420118","volume":"61","author":"C Ding","year":"2015","unstructured":"Ding C, Linear codes from some 2-designs, IEEE Trans. Inf. Theory, 2015, 61(6): 3265\u20133275.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"3313_CR15","doi-asserted-by":"publisher","first-page":"6240","DOI":"10.1109\/TIT.2017.2742499","volume":"63","author":"M Shi","year":"2017","unstructured":"Shi M, Guan Y, and Sol\u00e9 P, Two new families of two-weight codes, IEEE Trans. Inf. Theory, 2017, 63(10): 6240\u20136246.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3313_CR16","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.dam.2020.10.027","volume":"290","author":"M Shi","year":"2021","unstructured":"Shi M and Li X, Two classes of optimal p-ary few-weight codes from down-sets, Disc. Appl. Math., 2021, 290): 60\u201367.","journal-title":"Disc. Appl. Math."},{"key":"3313_CR17","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1007\/s10623-017-0442-5","volume":"86","author":"S Chang","year":"2018","unstructured":"Chang S and Hyun J, Linear codes from simplicial complexes, Des. Codes Cryptogr., 2018, 86): 2167\u20132181.","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"3313_CR18","doi-asserted-by":"publisher","first-page":"6762","DOI":"10.1109\/TIT.2020.2993179","volume":"66","author":"J Hyun","year":"2020","unstructured":"Hyun J, Lee J, and Lee Y, Infinite families of optimal linear codes constructed from simplicial complexes, IEEE Trans. Inf. Theory, 2020, 66(11): 6762\u20136773.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3313_CR19","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.dam.2018.07.007","volume":"254","author":"J Hyun","year":"2019","unstructured":"Hyun J, Kim H, and Na M, Optimal non-projective linear codes constructed from down-sets, Disc. Appl. Math., 2019, 254): 135\u2013145.","journal-title":"Disc. Appl. Math."},{"key":"3313_CR20","doi-asserted-by":"publisher","first-page":"2475","DOI":"10.1007\/s10623-020-00793-0","volume":"88","author":"J Hyun","year":"2020","unstructured":"Hyun J, Kim H, Wu Y, et al., Optimal minimal linear codes from posets, Des. Codes Cryptogr., 2020, 88): 2475\u20132492.","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"3313_CR21","doi-asserted-by":"publisher","first-page":"1823","DOI":"10.1109\/TIT.2023.3305609","volume":"70","author":"Z Hu","year":"2024","unstructured":"Hu Z, Li Y G, Li N, et al., New constructions of optimal linear codes from simplicial complex, IEEE Trans. Inf. Theory, 2024, 70(3): 1823\u20131835.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"3313_CR22","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/LCOMM.2020.3024907","volume":"25","author":"X Li","year":"2021","unstructured":"Li X and Shi M, A new family of optimal binary few-weight codes from simplicial complexes, IEEE Commun. Letters, 2021, 25(4): 1048\u20131051.","journal-title":"IEEE Commun. Letters"},{"issue":"6","key":"3313_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, and Yue Q, Optimal few-weight codes from simplicial complexes, IEEE Trans. Inf. Theory, 2020, 66(6): 3657\u20133663.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3313_CR24","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 and Hyun J Y, Few-weight codes over $${\\mathbb F}_{{p}} + u{\\mathbb F}_{{p}}$$ associated with down sets and their distance optimal Gray image, Disc. Appl. Math., 2020, 283): 315\u2013322.","journal-title":"Disc. Appl. Math."},{"key":"3313_CR25","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"J H Griesmer","year":"1960","unstructured":"Griesmer J H, A bound for error correcting codes, IBM Journal of Research and Development, 1960, 4): 532\u2013542.","journal-title":"IBM Journal of Research and Development"},{"issue":"5","key":"3313_CR26","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1109\/18.705584","volume":"44","author":"A Ashikhmin","year":"1998","unstructured":"Ashikhmin A and Barg A, Minimal vectors in linear codes, IEEE Trans. Inf. Theory, 1998, 44(5): 2010\u20132017.","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-025-3313-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-025-3313-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-025-3313-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T02:39:00Z","timestamp":1765593540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-025-3313-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["3313"],"URL":"https:\/\/doi.org\/10.1007\/s11424-025-3313-6","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"7 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}