{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T06:22:03Z","timestamp":1774851723619,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:00:00Z","timestamp":1771545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:00:00Z","timestamp":1771545600000},"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":["12171191, 12271199, 12441102"],"award-info":[{"award-number":["12171191, 12271199, 12441102"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171191, 12271199, 12441102"],"award-info":[{"award-number":["12171191, 12271199, 12441102"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"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-01789-4","type":"journal-article","created":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T12:28:50Z","timestamp":1771590530000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hull parameters of Projective Reed\u2013Muller codes"],"prefix":"10.1007","volume":"94","author":[{"given":"Yufeng","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinquan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,20]]},"reference":[{"issue":"4","key":"1789_CR1","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1090\/proc\/13863","volume":"146","author":"P Beelen","year":"2018","unstructured":"Beelen P., Datta M., Ghorpade S.: Maximum number of common zeros of homogeneous polynomials over finite fields. Proc. Am. Math. Soc. 146(4), 1451\u20131468 (2018).","journal-title":"Proc. Am. Math. Soc."},{"issue":"4","key":"1789_CR2","doi-asserted-by":"publisher","first-page":"565","DOI":"10.17323\/1609-4514-2022-22-4-565-593","volume":"22","author":"P Beelen","year":"2022","unstructured":"Beelen P., Datta M., Ghorpade S.: A combinatorial approach to the number of solutions of systems of homogeneous polynomial equations over finite fields. Mosc. Math. J. 22(4), 565\u2013593 (2022).","journal-title":"Mosc. Math. J."},{"issue":"5","key":"1789_CR3","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-Muller codes. IEEE Trans. Inf. Theory 48(5), 1035\u20131045 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1789_CR4","doi-asserted-by":"publisher","first-page":"7964","DOI":"10.1109\/TIT.2021.3117562","volume":"67","author":"M Cao","year":"2021","unstructured":"Cao M.: MDS codes with Galois hulls of arbitrary dimensions and the related entanglement-assisted quantum error correction. IEEE Trans. Inf. Theory 67(12), 7964\u20137984 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1789_CR5","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1109\/TIT.2022.3211887","volume":"69","author":"B Chen","year":"2023","unstructured":"Chen B., Ling S., Liu H.: Hulls of Reed-Solomon codes via algebraic geometry codes. IEEE Trans. Inf. Theory 69(2), 1005\u20131014 (2023).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1789_CR6","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0019-9958(70)90214-7","volume":"16","author":"P Delsarte","year":"1970","unstructured":"Delsarte P., Goethals J.M., MacWilliams F.J.: On generalized Reed-Muller codes and their relatives. Inf. Control 16(5), 403\u2013442 (1970).","journal-title":"Inf. Control"},{"key":"1789_CR7","unstructured":"Elkies N.D.: Linear codes and algebraic geometry in higher dimensions. Preprint (2006)."},{"issue":"10","key":"1789_CR8","doi-asserted-by":"publisher","first-page":"6619","DOI":"10.1109\/TIT.2021.3074526","volume":"67","author":"Y Gao","year":"2021","unstructured":"Gao Y., Yue Q., Huang X., Zhang J.: Hulls of generalized Reed-Solomon codes via Goppa codes and their applications to quantum codes. IEEE Trans. Inf. Theory 67(10), 6619\u20136626 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1789_CR9","doi-asserted-by":"publisher","first-page":"360","DOI":"10.3934\/amc.2023035","volume":"18","author":"SR Ghorpade","year":"2024","unstructured":"Ghorpade S.R., Ludhani R.: On the minimum distance, minimum weight codewords, and the dimension of projective Reed-Muller codes. Adv. Math. Commun. 18(2), 360\u2013382 (2024).","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"1789_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10623-017-0330-z","volume":"86","author":"K Guenda","year":"2018","unstructured":"Guenda K., Jitman S., Gulliver T.A.: Constructions of good entanglement-assisted quantum error correcting codes. Des. Codes Cryptogr. 86(1), 121\u2013136 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"1789_CR11","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":"1789_CR12","doi-asserted-by":"crossref","unstructured":"Kaplan N.: Weight enumerators of Reed-Muller codes from cubic curves and their duals. In: Arithmetic, Geometry, Cryptography, and Coding Theory. Contemporary Mathematics, vol. 722, pp. 59\u201378. American Mathematical Society, Providence (2017).","DOI":"10.1090\/conm\/722\/14535"},{"issue":"3","key":"1789_CR13","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s10623-024-01543-2","volume":"93","author":"N Kaplan","year":"2025","unstructured":"Kaplan N., Kim J.-L.: Hulls of projective Reed-Muller codes. Des. Codes Cryptogr. 93(3), 683\u2013699 (2025).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1789_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/TIT.1968.1054127","volume":"14","author":"T Kasami","year":"1968","unstructured":"Kasami T., Lin S., Peterson W.W.: New generalizations of the Reed-Muller codes\u2014part I: primitive codes. IEEE Trans. Inf. Theory 14(2), 189\u2013199 (1968).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1789_CR15","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1109\/TIT.1968.1054226","volume":"14","author":"T Kasami","year":"1968","unstructured":"Kasami T., Lin S., Peterson W.W.: Polynomial codes. IEEE Trans. Inf. Theory 14(6), 807\u2013814 (1968).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1789_CR16","doi-asserted-by":"crossref","unstructured":"Lachaud G.: Projective Reed-Muller codes. In: Coding Theory and Applications. Lecture Notes in Computer Science, vol. 311, pp. 125\u2013129. Springer, Berlin (1988).","DOI":"10.1007\/3-540-19368-5_13"},{"issue":"2","key":"1789_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0012-365X(90)90155-B","volume":"81","author":"G Lachaud","year":"1990","unstructured":"Lachaud G.: The parameters of projective Reed-Muller codes. Discret. Math. 81(2), 217\u2013221 (1990).","journal-title":"Discret. Math."},{"key":"1789_CR18","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":"1789_CR19","doi-asserted-by":"crossref","unstructured":"Pless V.: Introduction to the Theory of Error-Correcting Codes, 3rd edn. Wiley, New York (1998).","DOI":"10.1002\/9781118032749"},{"key":"1789_CR20","unstructured":"Roman S.: Advanced Linear Algebra, 2nd edn. Graduate Texts in Mathematics, vol. 135. Springer, New York (2005)."},{"issue":"4","key":"1789_CR21","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/23M1626153","volume":"8","author":"D Ruano","year":"2024","unstructured":"Ruano D., San-Jos\u00e9 R.: Hulls of projective Reed-Muller codes over the projective plane. SIAM J. Appl. Algebra Geom. 8(4), 846\u2013876 (2024).","journal-title":"SIAM J. Appl. Algebra Geom."},{"key":"1789_CR22","doi-asserted-by":"crossref","unstructured":"Ruano D., San-Jos\u00e9 R.: Quantum error-correcting codes from projective Reed\u2013Muller codes and their hull variation problem. J Algebra Appl (2025). arXiv:2312.15308.","DOI":"10.1142\/S0219498825410099"},{"issue":"12","key":"1789_CR23","doi-asserted-by":"publisher","first-page":"8511","DOI":"10.1109\/TIT.2024.3483998","volume":"70","author":"R San-Jos\u00e9","year":"2024","unstructured":"San-Jos\u00e9 R.: A recursive construction for projective Reed-Muller codes. IEEE Trans. Inf. Theory 70(12), 8511\u20138523 (2024).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1789_CR24","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1109\/18.104317","volume":"37","author":"AB S\u00f8rensen","year":"1991","unstructured":"S\u00f8rensen A.B.: Projective Reed-Muller codes. IEEE Trans. Inf. Theory 37(6), 1567\u20131576 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1789_CR25","unstructured":"S\u00f8rensen A.B.: A note on a gap in the proof of the minimum distance for projective Reed-Muller codes (2023). arXiv:2310.03574 [cs.IT]."},{"issue":"1","key":"1789_CR26","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 variable parameters $$[(q^m-1)\/r, k, d]$$. IEEE Trans. Inf. Theory 70(1), 93\u2013114 (2024).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1789_CR27","doi-asserted-by":"publisher","first-page":"2611","DOI":"10.1007\/BF02249124","volume":"30","author":"SG Vl\u0103du\u0163","year":"1985","unstructured":"Vl\u0103du\u0163 S.G., Manin Y.I.: Linear codes and modular curves. J. Sov. Math. 30(6), 2611\u20132643 (1985).","journal-title":"J. Sov. Math."},{"issue":"2","key":"1789_CR28","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/TIT.1968.1054128","volume":"14","author":"E Weldon","year":"1968","unstructured":"Weldon E.: New generalizations of the Reed-Muller codes-II: nonprimitive codes. IEEE Trans. Inf. Theory 14(2), 199\u2013205 (1968).","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-025-01789-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01789-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01789-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T05:02:15Z","timestamp":1774846935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01789-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,20]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1789"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01789-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,20]]},"assertion":[{"value":"24 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 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. The authors are supported by National Natural Science Foundation of China (Nos.12441102, 12171191, 12271199 ), the Project of International Cooperation and Exchanges NSFC (No.12411540221) and the Fundamental Research Funds for the Central Universities (No. CCNU25JCPT031).","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"57"}}