{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T06:22:08Z","timestamp":1774851728534,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"crossref","award":["202306500025"],"award-info":[{"award-number":["202306500025"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12471490"],"award-info":[{"award-number":["12471490"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NTU Research","award":["04INS000047C230GRT01"],"award-info":[{"award-number":["04INS000047C230GRT01"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10623-025-01761-2","type":"journal-article","created":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:23:12Z","timestamp":1773325392000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A tight upper bound on the number of nonzero weights of a quasi-cyclic code"],"prefix":"10.1007","volume":"94","author":[{"given":"Xiaoxiao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minjia","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"San","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,12]]},"reference":[{"issue":"5","key":"1761_CR1","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1109\/18.705584","volume":"45","author":"A Ashikhmin","year":"1998","unstructured":"Ashikhmin A., Barg A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 45(5), 2010\u20132017 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1761_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1026421315292","volume":"15","author":"AR Anderson","year":"1998","unstructured":"Anderson A.R., Ding C., Helleseth T., Kl\u00f8ve T.: How to build robust shared control systems. Des. Codes Cryptogr. 15(2), 111\u2013124 (1998).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"1761_CR3","first-page":"15","volume":"8","author":"T Alderson","year":"2019","unstructured":"Alderson T.: A note on full weight spectrum codes. Trans. Comb. 8(3), 15\u201322 (2019).","journal-title":"Trans. Comb."},{"issue":"1","key":"1761_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.3934\/amc.2019006","volume":"13","author":"T Alderson","year":"2019","unstructured":"Alderson T., Neri A.: Maximum weight spectrum codes. Adv. Math. Commun. 13(1), 101\u2013119 (2019).","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"1761_CR5","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0021-9800(69)80115-8","volume":"6","author":"EF Assmus","year":"1969","unstructured":"Assmus E.F., Mattson E.: New 5-designs. J. Comb. Theory 6(2), 122\u2013151 (1969).","journal-title":"J. Comb. Theory"},{"issue":"3\u20134","key":"1761_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma algebra system I: the user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997).","journal-title":"J. Symb. Comput."},{"key":"1761_CR7","first-page":"963","volume-title":"Handbook of Coding Theory","author":"P Charpin","year":"1998","unstructured":"Charpin P.: Open problems on cyclic codes. In: Pless V.S., Huffman C.W. (eds.) Handbook of Coding Theory, pp. 963\u20131063. Elsevier, New York (1998)."},{"key":"1761_CR8","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.disc.2014.05.007","volume":"331","author":"B Chen","year":"2014","unstructured":"Chen B., Liu H., Zhang G.: Some minimal cyclic codes over finite fields. Discret. Math. 331, 142\u2013150 (2014).","journal-title":"Discret. Math."},{"issue":"6","key":"1761_CR9","doi-asserted-by":"publisher","first-page":"4079","DOI":"10.1109\/TIT.2024.3356601","volume":"70","author":"B Chen","year":"2024","unstructured":"Chen B., Fu Y., Liu H.: Improved upper bounds on the number of non-zero weights of cyclic codes. IEEE Trans. Inf. Theory 70(6), 4079\u20134092 (2024).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1761_CR10","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1109\/TIT.2022.3208438","volume":"69","author":"B Chen","year":"2023","unstructured":"Chen B., Zhang G.: A tight upper bound on the number of non-zero weights of a cyclic code. IEEE Trans. Inf. Theory 69(2), 995\u20131004 (2023).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1761_CR11","unstructured":"Chen Z.: Report. http:\/\/www.tec.hkr.se\/~chen\/research\/codes\/"},{"issue":"5","key":"1761_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0019-9958(73)80007-5","volume":"23","author":"P Delsarte","year":"1973","unstructured":"Delsarte P.: Four fundamental parameters of a code and their combinatorial significance. Inf. Control 23(5), 407\u2013438 (1973).","journal-title":"Inf. Control"},{"issue":"3","key":"1761_CR13","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1109\/TIT.2008.2011511","volume":"55","author":"C Ding","year":"2009","unstructured":"Ding C.: The weight distribution of some irreducible cyclic codes. IEEE Trans. Inf. Theory 55(3), 955\u2013960 (2009).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1761_CR14","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/18.651076","volume":"44","author":"M Esmaeili","year":"1998","unstructured":"Esmaeili M., Gulliver T.A., Secord N.P., Mahmoud S.A.: A link between quasi-cyclic codes and convolutional codes. IEEE Trans. Inf. Theory 44, 431\u2013435 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1761_CR15","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1109\/18.79911","volume":"37","author":"TA Gulliver","year":"1991","unstructured":"Gulliver T.A., Bhargava V.K.: Some best rate $$1\/p$$ and rate $$(p-1)\/p$$ systematic quasi-cyclic codes. IEEE Trans. Inf. Theory 37, 552\u2013555 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1761_CR16","doi-asserted-by":"publisher","first-page":"1366","DOI":"10.1109\/18.144718","volume":"38","author":"TA Gulliver","year":"1992","unstructured":"Gulliver T.A., Bhargava V.K.: Nine good $$(m-1)\/pm$$ quasi-cyclic codes. IEEE Trans. Inf. Theory 38, 1366\u20131369 (1992).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1761_CR17","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1109\/18.144719","volume":"38","author":"TA Gulliver","year":"1992","unstructured":"Gulliver T.A., Bhargava V.K.: Somebest rate $$1\/p$$ and rate $$(p-1)\/p$$ systematic quasi-cyclic codes over GF$$(3)$$ and GF$$(4)$$. IEEE Trans. Inf. Theory 38, 1369\u20131374 (1992).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1761_CR18","doi-asserted-by":"publisher","first-page":"1750","DOI":"10.1109\/18.259670","volume":"39","author":"TA Gulliver","year":"1993","unstructured":"Gulliver T.A., Bhargava V.K.: Twelve good rate $$(m-r)\/pm$$ binary quasi-cyclic codes. IEEE Trans. Inf. Theory 39, 1750\u20131751 (1993).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1761_CR19","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)."},{"issue":"1\u20133","key":"1761_CR20","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1008319024396","volume":"17","author":"R Hill","year":"1999","unstructured":"Hill R.: An extension theorem for linear codes. Des. Codes Cryptogr. 17(1\u20133), 151\u2013157 (1999).","journal-title":"Des. Codes Cryptogr."},{"key":"1761_CR21","doi-asserted-by":"crossref","unstructured":"Hill R., Lizak P.: Extensions of linear codes. In: Proc. IEEE Int. Symp. Inf. Theory, September 1995, p. 345.","DOI":"10.1109\/ISIT.1995.550332"},{"key":"1761_CR22","doi-asserted-by":"crossref","unstructured":"Kasami T.: A Gilbert\u2013Varshamov bound for quasi-cyclic codes of rate $$1\/2$$. IEEE Trans. Inf. Theory IT-20, 679 (1974).","DOI":"10.1109\/TIT.1974.1055262"},{"key":"1761_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-11167-3","volume-title":"Applied Finite Group Actions","author":"A Kerber","year":"1999","unstructured":"Kerber A.: Applied Finite Group Actions. Springer, Berlin (1999)."},{"key":"1761_CR24","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0166-218X(00)00350-4","volume":"111","author":"K Lally","year":"2001","unstructured":"Lally K., Fitzpatrick P.: Algebraic structure of quasi-cyclic codes. Discret. Appl. Math. 111, 157\u2013175 (2001).","journal-title":"Discret. Appl. Math."},{"key":"1761_CR25","volume-title":"Finite Fields","author":"R Lidl","year":"2003","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (2003)."},{"issue":"7","key":"1761_CR26","doi-asserted-by":"publisher","first-page":"2751","DOI":"10.1109\/18.959257","volume":"47","author":"S Ling","year":"2001","unstructured":"Ling S., Sol\u00e9 P.: On the algebraic structure of quasi-cyclic codes I: finite fields. IEEE Trans. Inf. Theory 47(7), 2751\u20132760 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1761_CR27","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1024715527805","volume":"30","author":"S Ling","year":"2003","unstructured":"Ling S., Sol\u00e9 P.: On the algebraic structure of quasi-cyclic codes II: chain rings. Des. Codes Cryptogr. 30, 113\u2013130 (2003).","journal-title":"Des. Codes Cryptogr."},{"issue":"7","key":"1761_CR28","doi-asserted-by":"publisher","first-page":"2692","DOI":"10.1109\/TIT.2005.850142","volume":"51","author":"S Ling","year":"2005","unstructured":"Ling S., Sol\u00e9 P.: On the algebraic structure of quasi-cyclic codes III: generator theory. IEEE Trans. Inf. Theory 51(7), 2692\u20132700 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1761_CR29","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10623-005-1431-7","volume":"38","author":"S Ling","year":"2006","unstructured":"Ling S., Niederreiter H., Sol\u00e9 P.: On the algebraic structure of quasi-cyclic codes IV: repeated roots. Des. Codes Cryptogr. 38, 337\u2013361 (2006).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1761_CR30","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/j.1538-7305.1963.tb04003.x","volume":"42","author":"J Macwilliams","year":"1963","unstructured":"Macwilliams J.: A theorem on the distribution of weights in a systematic code. Bell Syst. Tech. J. 42(1), 79\u201394 (1963).","journal-title":"Bell Syst. Tech. J."},{"key":"1761_CR31","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1983","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1983)."},{"key":"1761_CR32","volume-title":"Advanced Modern Algebra","author":"JJ Rotman","year":"2003","unstructured":"Rotman J.J.: Advanced Modern Algebra. Prentice Hall, Upper Saddle River (2003)."},{"issue":"8","key":"1761_CR33","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1109\/TIT.2004.831861","volume":"50","author":"GE S\u00e9guin","year":"2004","unstructured":"S\u00e9guin G.E.: A class of $$1$$-generator quasicyclic codes. IEEE Trans. Inf. Theory 50(8), 1745\u20131753 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1761_CR34","unstructured":"S\u00e9guin G.E., Drolet G.: The theory of $$1$$-generator quasi-cyclic codes. Tech. Rep. Department of Electrical and Computer Engineering, Royal Military College, Kingston (1990)."},{"issue":"3","key":"1761_CR35","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1109\/TIT.2019.2946660","volume":"66","author":"M Shi","year":"2020","unstructured":"Shi M., Li X., Neri A., Sol\u00e9 P.: How many weights can a cyclic code have? IEEE Trans. Inf. Theory 66(3), 1449\u20131459 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1761_CR36","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s10801-024-01347-6","volume":"60","author":"M Shi","year":"2024","unstructured":"Shi M., Tong T., Honold T.: Sol\u00e9 P: The maximum number of homogeneous weights of linear codes over chain rings. J. Algebr. Comb. 60, 667\u2013688 (2024).","journal-title":"J. Algebr. Comb."},{"issue":"11","key":"1761_CR37","doi-asserted-by":"publisher","first-page":"6855","DOI":"10.1109\/TIT.2020.3001591","volume":"66","author":"M Shi","year":"2020","unstructured":"Shi M., Neri A., Sol\u00e9 P.: How many weights can a quasi-cyclic code have? IEEE Trans. Inf. Theory 66(11), 6855\u20136862 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1761_CR38","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10623-018-0488-z","volume":"87","author":"M Shi","year":"2019","unstructured":"Shi M., Zhu H., Sol\u00e9 P., Cohen G.D.: How many weights can a linear code have? Des. Codes Cryptogr. 87(1), 87\u201395 (2019).","journal-title":"Des. Codes Cryptogr."},{"key":"1761_CR39","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1137\/0137027","volume":"37","author":"G Solomon","year":"1979","unstructured":"Solomon G., van Tilborg H.C.A.: A connection between block codes and convolutional codes. SIAM J. Appl. Math. 37, 358\u2013369 (1979).","journal-title":"SIAM J. Appl. Math."},{"key":"1761_CR40","unstructured":"Weldon E.J., Jr.: Long quasi-cyclic codes are good. IEEE Trans. Inform. Theory IT-16, 130 (1970)."},{"key":"1761_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2023.102312","volume":"93","author":"H Zhang","year":"2024","unstructured":"Zhang H., Cao X.: A tight upper bound on the number of non-zero weights of a constacyclic code. Finite Field Appl. 93, 102312 (2024).","journal-title":"Finite Field Appl."},{"key":"1761_CR42","doi-asserted-by":"crossref","unstructured":"Zhu H., Li S., Shi M., Xia S., Sol\u00e9 P.: Some bounds on the cardinality of the b-symbol weight spectrum of codes. Discret. Math., 2026, 349(1): 114678.","DOI":"10.1016\/j.disc.2025.114678"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01761-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01761-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01761-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T05:02:21Z","timestamp":1774846941000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01761-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1761"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01761-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"9 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2026","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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"67"}}