{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T07:47:54Z","timestamp":1782287274604,"version":"3.54.5"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T00:00:00Z","timestamp":1782259200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T00:00:00Z","timestamp":1782259200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071001"],"award-info":[{"award-number":["12071001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s00373-026-03050-8","type":"journal-article","created":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T05:21:25Z","timestamp":1782278485000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Characterization of Plotkin-optimal two-weight codes over finite chain rings and some applications"],"prefix":"10.1007","volume":"42","author":[{"given":"Shitao","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minjia","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,24]]},"reference":[{"issue":"5","key":"3050_CR1","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1109\/18.705584","volume":"44","author":"A Ashikhmin","year":"1988","unstructured":"Ashikhmin, A., Barg, A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010\u20132017 (1988)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3050_CR2","first-page":"313","volume":"48","author":"GR Blakley","year":"1979","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. Proc. Nat. Comput. Conf. 48, 313\u2013317 (1979)","journal-title":"Proc. Nat. Comput. Conf."},{"key":"3050_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/9781009057226","volume-title":"Strongly Regular Graphs","author":"AE Brouwer","year":"2022","unstructured":"Brouwer, A.E., Van Maldeghem, H.: Strongly Regular Graphs. Cambridge University Press, Encyclopedia of Mathematics and Its Applications (2022)"},{"issue":"1","key":"3050_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-007-9136-8","volume":"48","author":"E Byrne","year":"2008","unstructured":"Byrne, E., Greferath, M., Honold, T.: Ring geometries, two-weight codes, and strongly regular graphs. Des. Codes Cryptogr. 48(1), 1\u201316 (2008)","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"3050_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10623-009-9359-y","volume":"57","author":"E Byrne","year":"2010","unstructured":"Byrne, E., Greferath, M., Kohnert, A., Skachek, V.: New bounds for codes over finite Frobenius rings. Des. Codes Cryptogr. 57(2), 169\u2013179 (2010)","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"3050_CR6","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/j.ffa.2012.01.002","volume":"18","author":"E Byrne","year":"2012","unstructured":"Byrne, E., Kiermaier, M., Sneyd, A.: Properties of codes with two homogeneous weights. Finite Fields Appl. 18(4), 711\u2013727 (2012)","journal-title":"Finite Fields Appl."},{"issue":"2","key":"3050_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1112\/blms\/18.2.97","volume":"18","author":"R Calderbank","year":"1986","unstructured":"Calderbank, R., Kantor, W.M.: The geometry of two-weight codes. Bull. Lond. Math. Soc. 18(2), 97\u2013122 (1986)","journal-title":"Bull. Lond. Math. Soc."},{"issue":"4","key":"3050_CR8","first-page":"143","volume":"39","author":"AR Calderbank","year":"1984","unstructured":"Calderbank, A.R., Goethals, J.M.: Three-weight codes and association schemes. Philips J. Res. 39(4), 143\u2013152 (1984)","journal-title":"Philips J. Res."},{"issue":"4","key":"3050_CR9","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1109\/18.681328","volume":"44","author":"C Carlet","year":"1998","unstructured":"Carlet, C.: $$\\mathbb{Z} _{2^k}$$-linear codes. IEEE Trans. Inf. Theory 44(4), 1543\u20131547 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"3050_CR10","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 fron simplicial complexes. Des. Codes Cryptogr. 86(10), 2167\u20132181 (2018)","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"3050_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10623-013-9857-9","volume":"74","author":"B Chen","year":"2015","unstructured":"Chen, B., Liu, H., Zhang, G.: A class of minimal cyclic codes over finite fields. Des. Codes Cryptogr. 74(2), 285\u2013300 (2015)","journal-title":"Des. Codes Cryptogr."},{"issue":"12","key":"3050_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113101","volume":"345","author":"X Cheng","year":"2022","unstructured":"Cheng, X., Cao, X., Qian, L.: Constructing few-weight linear codes and strongly regular graphs. Discret. Math. 345(12), 113101 (2022)","journal-title":"Discret. Math."},{"issue":"3","key":"3050_CR13","first-page":"208","volume":"33","author":"I Constantinescu","year":"1997","unstructured":"Constantinescu, I., Heise, W.: A metric for codes over residue class rings of integers. Probl. Inf. Transm. 33(3), 208\u2013213 (1997)","journal-title":"Probl. Inf. Transm."},{"issue":"1","key":"3050_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2004.09.011","volume":"330","author":"C Ding","year":"2005","unstructured":"Ding, C., Wang, X.: A coding theory construction of new systematic authentication codes. Theor. Comput. Sci. 330(1), 81\u201399 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"3050_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-45066-1_2","volume":"2731","author":"C Ding","year":"2003","unstructured":"Ding, C., Yuan, J.: Covering and secret sharing with linear codes. Discrete Mathematics and Theoretical Computer Science, Berlin, Germany: Springer-Verlag 2731, 11\u201325 (2003)","journal-title":"Discrete Mathematics and Theoretical Computer Science, Berlin, Germany: Springer-Verlag"},{"issue":"11","key":"3050_CR16","doi-asserted-by":"publisher","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(11), 5835\u20135842 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20133","key":"3050_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(72)90024-6","volume":"3","author":"P Delsarte","year":"1972","unstructured":"Delsarte, P.: Weights of linear codes and strongly regular normed spaces. Discrete Math. 3(1\u20133), 47\u201364 (1972)","journal-title":"Discrete Math."},{"issue":"6","key":"3050_CR18","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1142\/S0219498806002022","volume":"5","author":"M Greferath","year":"2006","unstructured":"Greferath, M., McGuire, G., O\u2019Sullivan, M.E.: On Plotkin-optimal codes over finite Frobenius rings. J. Alg. Appl. 5(6), 799\u2013815 (2006)","journal-title":"J. Alg. Appl."},{"issue":"1\u20133","key":"3050_CR19","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.disc.2004.10.002","volume":"289","author":"M Greferath","year":"2004","unstructured":"Greferath, M., O\u2019Sullivan, M.E.: On bounds for codes over Frobenius rings under homogeneous weights. Discrete Math. 289(1\u20133), 11\u201324 (2004)","journal-title":"Discrete Math."},{"issue":"7","key":"3050_CR20","doi-asserted-by":"publisher","first-page":"2522","DOI":"10.1109\/18.796395","volume":"45","author":"M Greferath","year":"1999","unstructured":"Greferath, M., Schmidt, S.E.: Gray isometries for finite chain rings and a nonlinear ternary $$(36,3^{12},15)$$ code. IEEE Trans. Inf. Theory 45(7), 2522\u20132524 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"3050_CR21","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"AR Hammons","year":"1994","unstructured":"Hammons, A.R., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., Sol\u00e9, P.: The $$\\mathbb{Z} _4$$-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory 40(2), 301\u2013319 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"3050_CR22","first-page":"205","volume":"35","author":"T Honold","year":"1999","unstructured":"Honold, T., Nechaev, A.A.: Weighted modules and representations of codes. Problems Inf. Transmiss. 35(3), 205\u2013223 (1999)","journal-title":"Problems Inf. Transmiss."},{"key":"3050_CR23","doi-asserted-by":"crossref","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes, Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511807077"},{"issue":"1","key":"3050_CR24","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1109\/TIT.2018.2843818","volume":"65","author":"JY Hyun","year":"2019","unstructured":"Hyun, J.Y., Lee, Y.: Characterization of $$p$$-ary bent functions in terms of strongly regular graphs. IEEE Trans. Inf. Theory 65(1), 676\u2013684 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"3050_CR25","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10623-022-01118-z","volume":"91","author":"M Kiermaier","year":"2023","unstructured":"Kiermaier, M., Kurz, S., Sol\u00e9, P., Stoll, M., Wassermann, A.: On strongly walk regular graphs, triple sum sets and their codes. Des. Codes Cryptogr. 91(2), 645\u2013675 (2023)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"3050_CR26","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12190-022-01736-9","volume":"69","author":"S Li","year":"2023","unstructured":"Li, S., Shi, M.: Two infinite families of two-weight codes over $$\\mathbb{Z} _{2^m}$$. J. Appl. Math. Comput. 69(1), 201\u2013218 (2023)","journal-title":"J. Appl. Math. Comput."},{"issue":"5","key":"3050_CR27","doi-asserted-by":"publisher","first-page":"2696","DOI":"10.1109\/TIT.2019.2891562","volume":"65","author":"H Liu","year":"2019","unstructured":"Liu, H., Maouche, Y.: Two or few-weight trace codes over $${\\mathbb{F} _{q}}+u{\\mathbb{F} _{q}}$$. IEEE Trans. Inf. Theory 65(5), 2696\u20132703 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3050_CR28","volume-title":"Finite Rings with Identity","author":"BR McDonald","year":"1974","unstructured":"McDonald, B.R.: Finite Rings with Identity. Marcel Dekker, New York (1974)"},{"issue":"6","key":"3050_CR29","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/PL00012382","volume":"10","author":"G Norton","year":"2000","unstructured":"Norton, G., Salagean, A.: On the structure of linear and cyclic codes over a finite chain ring. Appl. Algebra Eng. Commun. Comput. 10(6), 489\u2013506 (2000)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"11","key":"3050_CR30","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"},{"issue":"1","key":"3050_CR31","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10801-020-01006-6","volume":"55","author":"M Shi","year":"2022","unstructured":"Shi, M., Helleseth, T., Sol\u00e9, P.: Strongly regular graphs from reducible cyclic codes. J. Algebraic Comb. 55(1), 173\u2013184 (2022)","journal-title":"J. Algebraic Comb."},{"issue":"12","key":"3050_CR32","doi-asserted-by":"publisher","first-page":"7769","DOI":"10.1109\/TIT.2021.3114636","volume":"67","author":"M Shi","year":"2021","unstructured":"Shi, M., Honold, T., Sol\u00e9, P., Qiu, Y., Wu, R., Sepasdar, Z.: The geometry of two-weight codes over $$\\mathbb{Z} _{p^m}$$. IEEE Trans. Inf. Theory 67(12), 7769\u20137781 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3050_CR33","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/s00373-021-02430-6","volume":"38","author":"M Shi","year":"2022","unstructured":"Shi, M., Kiermaier, M., Kurz, S., Sol\u00e9, P.: Three-weight codes over rings and strongly walk regular graphs. Graphs and Combinatorics 38, 56 (2022)","journal-title":"Graphs and Combinatorics"},{"issue":"6","key":"3050_CR34","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1007\/s10623-017-0390-0","volume":"86","author":"M Shi","year":"2018","unstructured":"Shi, M., Sepasdar, Z., Alahmadi, A., Sol\u00e9, P.: On two-weight $$\\mathbb{Z} _{2^k}$$-codes. Des. Codes Cryptogr. 86(6), 1201\u20131209 (2018)","journal-title":"Des. Codes Cryptogr."},{"issue":"10","key":"3050_CR35","doi-asserted-by":"publisher","first-page":"2395","DOI":"10.1007\/s10623-019-00628-7","volume":"87","author":"M Shi","year":"2019","unstructured":"Shi, M., Sol\u00e9, P.: Three-weight codes, triple sum sets, and strongly walk regular graphs. Des. Codes Cryptogr. 87(10), 2395\u20132404 (2019)","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"3050_CR36","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11424-014-2188-8","volume":"27","author":"M Shi","year":"2014","unstructured":"Shi, M., Wang, Y.: Optimal binary codes from one-Lee weight codes and two-Lee weight projective codes over $$\\mathbb{Z} _4$$. J. Syst. Sci. Complex. 27(4), 195\u2013210 (2014)","journal-title":"J. Syst. Sci. Complex."},{"issue":"3","key":"3050_CR37","first-page":"1","volume":"88","author":"M Shi","year":"2020","unstructured":"Shi, M., Wang, X., Sol\u00e9, P.: Two families of two-weight codes over $$\\mathbb{Z} _4$$. Des. Codes Cryptogr. 88(3), 1\u201313 (2020)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"3050_CR38","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1109\/TIT.2016.2628408","volume":"63","author":"M Shi","year":"2017","unstructured":"Shi, M., Xu, L., Yang, G.: A note on one weight and two weight projective $$\\mathbb{Z} _4$$-codes. IEEE Trans. Inf. Theory 63(1), 177\u2013182 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"3050_CR39","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"DR Stinson","year":"1992","unstructured":"Stinson, D.R.: An explication of secret sharing schemes. Des. Codes Cryptogr. 2(4), 357\u2013390 (1992)","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"3050_CR40","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1007\/s10623-022-01176-3","volume":"91","author":"HC Tang","year":"2023","unstructured":"Tang, H.C., Suprijanto, D.: A general family of Plotkin-optimal two-weight codes over $$\\mathbb{Z} _4$$. Des. Codes Cryptogr. 91(5), 1737\u20131750 (2023)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"3050_CR41","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1017\/S0004972722000399","volume":"107","author":"HC Tang","year":"2023","unstructured":"Tang, H.C., Suprijanto, D.: New optimal linear codes over $$\\mathbb{Z} _4$$. Bull. Aust. Math. Soc. 107(1), 158\u2013169 (2023)","journal-title":"Bull. Aust. Math. Soc."},{"issue":"4","key":"3050_CR42","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.jcta.2013.01.006","volume":"120","author":"ER van Dam","year":"2013","unstructured":"van Dam, E.R., Omidi, G.R.: Strongly walk-regular graphs. J. Comb. Theory A 120(4), 803\u2013810 (2013)","journal-title":"J. Comb. Theory A"},{"issue":"1","key":"3050_CR43","doi-asserted-by":"publisher","first-page":"73","DOI":"10.3934\/amc.2020044","volume":"15","author":"D Wang","year":"2021","unstructured":"Wang, D., Cao, X., Luo, G.: A class of linear codes and their complete weight enumerators. Adv. Math. Commun. 15(1), 73\u201397 (2021)","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"3050_CR44","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10623-012-9769-0","volume":"72","author":"JA Wood","year":"2014","unstructured":"Wood, J.A.: Relative one-weight linear codes. Des. Codes Cryptogr. 72(2), 331\u2013344 (2014)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"3050_CR45","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"},{"issue":"6","key":"3050_CR46","doi-asserted-by":"publisher","first-page":"1662","DOI":"10.3934\/amc.2023013","volume":"18","author":"C Zhu","year":"2024","unstructured":"Zhu, C., Liao, Q.: Several classes of new projective three-weight or four-weight linear codes and their applications in $$s$$-sum sets. Adv. Math. Commun. 18(6), 1662\u20131680 (2024)","journal-title":"Adv. Math. Commun."},{"key":"3050_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2023.102186","volume":"88","author":"C Zhu","year":"2023","unstructured":"Zhu, C., Liao, Q.: Two new classes of projective two-weight linear codes. Finite Fields Appl. 88, 102186 (2023)","journal-title":"Finite Fields Appl."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03050-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03050-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03050-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T07:04:32Z","timestamp":1782284672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03050-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,24]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["3050"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03050-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,24]]},"assertion":[{"value":"1 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"They have no known competing financial or non-financial interests or personal relationships that might influence the work reported herein. All authors gave their informed consent.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"All authors have seen and approved the final version of the submitted manuscript. They guarantee that this article is the authors original work and has not been previously published or considered for publication elsewhere.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"I declare that the authors have no competing interests as defined by Springer, or other interests that might be perceived to influence the results and\/or discussion reported in this paper.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"60"}}