{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:39:54Z","timestamp":1740148794213,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T00:00:00Z","timestamp":1679961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T00:00:00Z","timestamp":1679961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Innovation Program for Quantum Science and Technology","award":["2021ZD0302904"],"award-info":[{"award-number":["2021ZD0302904"]}]},{"name":"Anhui Initiative in Quantum Information Technologies","award":["AHY150200"],"award-info":[{"award-number":["AHY150200"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s12190-023-01852-0","type":"journal-article","created":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T15:02:56Z","timestamp":1680015776000},"page":"2695-2715","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A unified construction of optimal and distance optimal two or three-weight codes"],"prefix":"10.1007","volume":"69","author":[{"given":"Sen","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0993-3689","authenticated-orcid":false,"given":"Yi","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianhong","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,28]]},"reference":[{"key":"1852_CR1","first-page":"143","volume":"39","author":"A Calderbank","year":"1984","unstructured":"Calderbank, A., Goethals, J.: Three-weight codes and association schemes. Philips J. Res. 39, 143\u2013152 (1984)","journal-title":"Philips J. Res."},{"issue":"1","key":"1852_CR2","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":"1852_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(84)90047-5","volume":"50","author":"B Courteau","year":"1984","unstructured":"Courteau, B., Wolfmann, J.: On triple sum sets and three-weight codes. Discrete Math. 50, 179\u2013191 (1984)","journal-title":"Discrete Math."},{"key":"1852_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1112\/blms\/18.2.97","volume":"18","author":"A Calderbank","year":"1986","unstructured":"Calderbank, A., Kantor, W.: The geometry of two-weight codes. Bull. Lond. Math. Soc. 18, 97\u2013122 (1986)","journal-title":"Bull. Lond. Math. Soc."},{"key":"1852_CR5","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.ffa.2015.01.012","volume":"34","author":"X Wang","year":"2015","unstructured":"Wang, X., Zheng, D., Hu, L., Zeng, X.: The weight distributions of two classes of binary cyclic codes. Finite Fields Appl. 34, 192\u2013207 (2015)","journal-title":"Finite Fields Appl."},{"issue":"4","key":"1852_CR6","doi-asserted-by":"publisher","first-page":"2296","DOI":"10.1109\/TIT.2019.2956130","volume":"66","author":"S Mesnager","year":"2020","unstructured":"Mesnager, S., Sinak, A.: Several classes of minimal linear codes with few weights from weakly regular plateaued functions. IEEE Trans. Inf. Theory 66(4), 2296\u20132310 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1852_CR7","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TIT.2005.862125","volume":"52","author":"J Yuan","year":"2006","unstructured":"Yuan, J., Carlet, C., Ding, C.: The weight distribution of a class of linear codes from perfect nonlinear functions. IEEE Trans. Inf. Theory 52(2), 712\u2013717 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1852_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ffa.2016.07.001","volume":"42","author":"G Vega","year":"2016","unstructured":"Vega, G.: A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field. Finite Fields Appl. 42, 23\u201338 (2016)","journal-title":"Finite Fields Appl."},{"key":"1852_CR9","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.: Few-weight codes over $${{{\\mathbb{F} }}_p}+u{{{\\mathbb{F} }}_p}$$ associated with down sets and their distance optimal Gray image. Discrete Appl. Math. 283, 315\u2013322 (2020)","journal-title":"Discrete Appl. Math."},{"key":"1852_CR10","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., Na, M.: Optimal non-projective linear codes constructed from down-sets. Discret. Appl. Math. 254, 135\u2013145 (2019)","journal-title":"Discret. Appl. Math."},{"key":"1852_CR11","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., Li, X.: Two classes of optimal $$p$$-ary few-weight codes from down-sets. Discret. Appl. Math. 290, 60\u201367 (2021)","journal-title":"Discret. Appl. Math."},{"issue":"12","key":"1852_CR12","doi-asserted-by":"publisher","first-page":"2346","DOI":"10.1109\/LCOMM.2016.2614934","volume":"20","author":"M Shi","year":"2016","unstructured":"Shi, M., Liu, Y., Sol\u00e9, P.: Optimal two-weight codes from trace codes over $${{\\mathbb{F} }_2}+u{{\\mathbb{F} }_2}$$. IEEE Commun. Lett. 20(12), 2346\u20132349 (2016)","journal-title":"IEEE Commun. Lett."},{"issue":"5","key":"1852_CR13","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":"1852_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2022.101994","volume":"80","author":"M Shi","year":"2022","unstructured":"Shi, M., Li, X.: Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image. Finite Fields Their Appl. 80, 101994 (2022)","journal-title":"Finite Fields Their Appl."},{"issue":"6","key":"1852_CR15","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"},{"issue":"5","key":"1852_CR16","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s12095-016-0206-5","volume":"9","author":"M Shi","year":"2017","unstructured":"Shi, M., Wu, R., Liu, Y., Sol\u00e9, P.: Two and three weight codes over $${{\\mathbb{F} }_p}+u{{\\mathbb{F} }_p}$$. Cryptogr. Commun. 9(5), 637\u2013646 (2017)","journal-title":"Cryptogr. Commun."},{"issue":"10","key":"1852_CR17","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., Sol\u00e9, P.: Two new families of two-weight codes. IEEE Trans. Inf. Theory 63(10), 6240\u20136246 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1852_CR18","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1007\/s12095-017-0272-3","volume":"10","author":"G Luo","year":"2018","unstructured":"Luo, G., Cao, X.: Five classes of optimal two-weight linear codes. Cryptogr. Commun. 10(6), 1119\u20131135 (2018)","journal-title":"Cryptogr. Commun."},{"key":"1852_CR19","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.dam.2016.09.050","volume":"219","author":"M Shi","year":"2017","unstructured":"Shi, M., Liu, Y., Sol\u00e9, P.: Optimal binary codes from trace codes over a non-chain ring. Discret. Appl. Math. 219, 176\u2013181 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"1852_CR20","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., 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}$$. Discret. Math. 341(2), 350\u2013357 (2018)","journal-title":"Discret. Math."},{"key":"1852_CR21","unstructured":"Yan, H., Zuo, K., Luo, G.: Infinite families of optimal linear codes and their applications to distributed storage systems. JAMC 1-17 (2022)"},{"issue":"6","key":"1852_CR22","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"J Griesmer","year":"1960","unstructured":"Griesmer, J.: A bound for error correcting codes. IBM J. Res. Dev. 4(6), 532\u2013542 (1960)","journal-title":"IBM J. Res. Dev."},{"key":"1852_CR23","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Cambridge Univ. Press, Cambridge (1997)"},{"issue":"1","key":"1852_CR24","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TIT.2010.2090272","volume":"57","author":"C Ma","year":"2011","unstructured":"Ma, C., Zeng, L., Liu, Y., Feng, D., Ding, C.: The weight enumerator of a class of cyclic codes. IEEE Trans. Inf. Theory. 57(1), 397\u2013402 (2011)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"1852_CR25","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes. Available: http:\/\/www.codetables.de (2021)"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01852-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01852-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01852-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T15:27:42Z","timestamp":1685114862000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01852-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,28]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1852"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01852-0","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2023,3,28]]},"assertion":[{"value":"17 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}