{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:58Z","timestamp":1750308658929,"version":"3.41.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T00:00:00Z","timestamp":1735084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T00:00:00Z","timestamp":1735084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Hong Kong Research Grants Council","award":["16301123"],"award-info":[{"award-number":["16301123"]}]},{"name":"the UAEU-AUA joint research","award":["G00004614"],"award-info":[{"award-number":["G00004614"]}]},{"name":"The Fundamental Research Funds for the Central Universities","award":["JZ2024HGTB0203"],"award-info":[{"award-number":["JZ2024HGTB0203"]}]},{"DOI":"10.13039\/501100003995","name":"Anhui Provincial Natural Science Foundation","doi-asserted-by":"crossref","award":["2408085MA014"],"award-info":[{"award-number":["2408085MA014"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10623-024-01549-w","type":"journal-article","created":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T03:42:57Z","timestamp":1735098177000},"page":"1575-1595","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The support designs of several families of lifted linear codes"],"prefix":"10.1007","volume":"93","author":[{"given":"Cunsheng","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhonghua","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qianqian","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,25]]},"reference":[{"key":"1549_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316529836","volume-title":"Designs and their Codes","author":"EF Assmus Jr","year":"1992","unstructured":"Assmus E.F. Jr., Key J.D.: Designs and their Codes. Cambridge University Press, Cambridge (1992)."},{"key":"1549_CR2","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0021-9800(69)80115-8","volume":"6","author":"EF Assmus Jr","year":"1969","unstructured":"Assmus E.F. Jr., Mattson H.F. Jr.: New 5-designs. J. Comb. Theory 6, 122\u2013151 (1969).","journal-title":"J. Comb. Theory"},{"key":"1549_CR3","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10623-013-9911-7","volume":"73","author":"S Ballet","year":"2014","unstructured":"Ballet S., Rolland R.: On low weight codewords of generalized affine and projective Reed\u2013Muller codes. Des. Codes Cryptogr. 73, 271\u2013297 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"1549_CR4","doi-asserted-by":"crossref","unstructured":"Berger T.P., de Maximy L.: Cyclic projective Reed\u2013Muller codes. In: Boztas, S., Shparlinski, I.E. (eds.) AAECC-14, LNCS 2227, pp. 77\u201381. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45624-4_8"},{"issue":"5","key":"1549_CR5","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1109\/18.995540","volume":"48","author":"TP Berger","year":"2002","unstructured":"Berger T.P.: Automorphism groups of homogeneous and projective Reed\u2013Muller codes. IEEE Trans. Inf. Theory 48(5), 1035\u20131045 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1549_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139507660","volume-title":"Design Theory","author":"T Beth","year":"1999","unstructured":"Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1999)."},{"issue":"2","key":"1549_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."},{"key":"1549_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114400","volume":"989","author":"C Ding","year":"2024","unstructured":"Ding C.: New support 5-designs from some lifted codes. Theoret. Comput. Sci. 989, 114400 (2024).","journal-title":"Theoret. Comput. Sci."},{"key":"1549_CR9","doi-asserted-by":"publisher","first-page":"2415","DOI":"10.1016\/j.disc.2017.05.013","volume":"340","author":"C Ding","year":"2017","unstructured":"Ding C., Li C.: Infinite families of 2-designs and 3-designs from linear codes. Discret. Math. 340, 2415\u20132431 (2017).","journal-title":"Discret. Math."},{"issue":"9","key":"1549_CR10","doi-asserted-by":"publisher","first-page":"5419","DOI":"10.1109\/TIT.2020.2990396","volume":"66","author":"C Ding","year":"2020","unstructured":"Ding C., Tang C.: Infinite families of near MDS codes holding $$t$$-designs. IEEE Trans. Inf. Theory 66(9), 5419\u20135428 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1549_CR11","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/s12095-021-00470-6","volume":"13","author":"C Ding","year":"2021","unstructured":"Ding C., Tang C.: The linear codes of $$t$$-designs held in the Reed\u2013Muller and Simplex codes. Cryptogr. Commun. 13, 927\u2013949 (2021).","journal-title":"Cryptogr. Commun."},{"key":"1549_CR12","doi-asserted-by":"publisher","DOI":"10.1142\/12697","volume-title":"Designs from Linear Codes","author":"C Ding","year":"2022","unstructured":"Ding C., Tang C.: Designs from Linear Codes, 2nd edn World Scientific, Singapore (2022).","edition":"2"},{"issue":"3","key":"1549_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/jcd.21682","volume":"28","author":"X Du","year":"2020","unstructured":"Du X., Wang R., Fan C.: Infinite families of $$2$$-designs from a class of cyclic codes. J. Combin. Des. 28(3), 157\u2013170 (2020).","journal-title":"J. Combin. Des."},{"issue":"4","key":"1549_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1134\/S0032946009040024","volume":"45","author":"EV Gorkunov","year":"2009","unstructured":"Gorkunov E.V.: The group of permutation automorphisms of a $$q$$-ary Hamming code. Probl. Inf. Transm. 45(4), 309\u2013316 (2009).","journal-title":"Probl. Inf. Transm."},{"issue":"2","key":"1549_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(77)90078-4","volume":"18","author":"T Helleseth","year":"1977","unstructured":"Helleseth T., Klove T., Mykkeltveit J.: The weight distribution of irreducible cyclic codes with block lengths $$n_1((q^l -1)\/N)$$. Discret. Math. 18(2), 179\u2013211 (1977).","journal-title":"Discret. Math."},{"issue":"10","key":"1549_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113538","volume":"346","author":"Z Heng","year":"2023","unstructured":"Heng Z., Wang X.: New infinite families of near MDS codes holding t-designs. Discret. Math. 346(10), 113538 (2023).","journal-title":"Discret. Math."},{"key":"1549_CR17","unstructured":"Huffman W.C.: Codes and groups, handbook of coding theory. In: Pless, V.S., Huffman, W.C. (eds.), Ch. 6, pp. 1345\u20131440. Elsevier, Amsterdam (1998)"},{"key":"1549_CR18","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)."},{"key":"1549_CR19","doi-asserted-by":"crossref","unstructured":"Lachaud, G.: Projective Reed\u2013Muller codes. In: Coding Theory and Applications, vol. 311, pp. 125\u2013129. Lecture Notes in Computer Science. Springer, Berlin (1988)","DOI":"10.1007\/3-540-19368-5_13"},{"key":"1549_CR20","doi-asserted-by":"publisher","first-page":"2447","DOI":"10.1007\/s10623-019-00630-z","volume":"87","author":"S Li","year":"2019","unstructured":"Li S.: On the weight distribution of second order Reed-Muller codes and their relatives. Des. Codes Cryptogr. 87, 2447\u20132460 (2019).","journal-title":"Des. Codes Cryptogr."},{"key":"1549_CR21","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)."},{"key":"1549_CR22","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0097-3165(72)90088-X","volume":"12","author":"V Pless","year":"1972","unstructured":"Pless V.: Symmetry codes over $${\\rm GF }(3)$$ and new 5-designs. J. Combin. Theory Ser. A 12, 119\u2013142 (1972).","journal-title":"J. Combin. Theory Ser. A"},{"issue":"9","key":"1549_CR23","doi-asserted-by":"publisher","first-page":"6316","DOI":"10.1109\/TIT.2024.3436923","volume":"70","author":"M Shi","year":"2024","unstructured":"Shi M., Li S., Helleseth T.: The weight enumerator polynomials of the lifted codes of the projective Solomon\u2013Stiffler codes. IEEE Trans. Inf. Theory 70(9), 6316\u20136325 (2024).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1549_CR24","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1109\/18.104317","volume":"37","author":"A S\u00f8rensen","year":"1991","unstructured":"S\u00f8rensen A.: Projective Reed\u2013Muller codes. IEEE Trans. Inf. Theory 37(6), 1567\u20131576 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1549_CR25","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1109\/TIT.2023.3322990","volume":"70","author":"Z Sun","year":"2024","unstructured":"Sun Z., Ding C., Wang X.: Two classes of constacyclic codes with parameters $$[(q^m-1)\/r, k, d]$$. IEEE Trans. Inf. Theory 70(1), 93\u2013114 (2024).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1549_CR26","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/TIT.2020.3032600","volume":"67","author":"C Tang","year":"2021","unstructured":"Tang C., Ding C.: An infinite family of linear codes supporting $$4$$-designs. IEEE Trans. Inf. Theory 67(1), 244\u2013254 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1549_CR27","doi-asserted-by":"publisher","first-page":"3691","DOI":"10.1109\/TIT.2019.2959764","volume":"66","author":"C Tang","year":"2020","unstructured":"Tang C., Ding C., Xiong M.: Codes, differentially $$\\delta $$-uniform functions and $$t$$-designs. IEEE Trans. Inf. Theory 66(6), 3691\u20133703 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1549_CR28","unstructured":"Tonchev, V.D.: Codes. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn., pp. 677\u2013701. CRC Press, New York (2007)"},{"key":"1549_CR29","first-page":"1229","volume-title":"Handbook of Coding Theory","author":"VD Tonchev","year":"1998","unstructured":"Tonchev V.D.: Codes and designs. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, vol. II, pp. 1229\u20131268. Elsevier, Amsterdam (1998)."},{"key":"1549_CR30","volume-title":"Geometry of Classical Groups Over Finite Fields","author":"Z Wan","year":"2002","unstructured":"Wan Z.: Geometry of Classical Groups Over Finite Fields, 2nd edn Science Press, Beijing (2002).","edition":"2"},{"issue":"7","key":"1549_CR31","doi-asserted-by":"publisher","first-page":"4344","DOI":"10.1109\/TIT.2022.3157199","volume":"68","author":"G Xu","year":"2022","unstructured":"Xu G., Cao X., Qu L.: Infinite families of 3-designs and 2-designs from almost MDS codes. IEEE Trans. Inf. Theory 68(7), 4344\u20134353 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1549_CR32","doi-asserted-by":"publisher","first-page":"4365","DOI":"10.1109\/TIT.2022.3156072","volume":"68","author":"Q Yan","year":"2022","unstructured":"Yan Q., Zhou J.: Infinite families of linear codes supporting more $$t$$-designs. IEEE Trans. Inf. Theory 68(7), 4365\u20134377 (2022).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01549-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01549-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01549-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:54:28Z","timestamp":1750276468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01549-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,25]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1549"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01549-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,12,25]]},"assertion":[{"value":"2 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 December 2024","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 there are no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}