{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T02:02:54Z","timestamp":1784685774856,"version":"3.55.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T00:00:00Z","timestamp":1781740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T00:00:00Z","timestamp":1781740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s10623-026-01889-9","type":"journal-article","created":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T12:25:53Z","timestamp":1781785553000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalized Hamming weights of additive codes and geometric counterparts"],"prefix":"10.1007","volume":"94","author":[{"given":"Jozefien","family":"D\u2019haeseleer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sascha","family":"Kurz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,18]]},"reference":[{"issue":"4","key":"1889_CR1","doi-asserted-by":"publisher","first-page":"828","DOI":"10.3934\/amc.2021024","volume":"17","author":"S Ball","year":"2023","unstructured":"Ball S., Gamboa G., Lavrauw M.: On additive MDS codes over small fields. Adv. Math. Commun. 17(4), 828\u2013844 (2023).","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"1889_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10623-024-01519-2","volume":"93","author":"S Ball","year":"2025","unstructured":"Ball S., Lavrauw M., Popatia T.: Griesmer type bounds for additive codes over finite fields, integral and fractional MDS codes. Des. Codes Cryptogr. 93(1), 175\u2013196 (2025).","journal-title":"Des. Codes Cryptogr."},{"key":"1889_CR3","unstructured":"Ball S., Popatia T.: Additive codes from linear codes. arXiv preprint (2025). arxiv:2506.03805."},{"issue":"4","key":"1889_CR4","doi-asserted-by":"publisher","first-page":"4.66","DOI":"10.37236\/7810","volume":"25","author":"A Bishnoi","year":"2018","unstructured":"Bishnoi A., Mattheus S., Schillewaert J.: Minimal multiple blocking sets. Electron. J. Comb. 25(4), 4.66 (2018).","journal-title":"Electron. J. Comb."},{"issue":"1","key":"1889_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01305953","volume":"14","author":"A Blokhuis","year":"1994","unstructured":"Blokhuis A.: On the size of a blocking set in $$\\operatorname{PG}(2, p)$$. Combinatorica 14(1), 111\u2013114 (1994).","journal-title":"Combinatorica"},{"issue":"1","key":"1889_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1023\/A:1011265011802","volume":"24","author":"H Chen","year":"2001","unstructured":"Chen H., Coffey J.T.: Trellis structure and higher weights of extremal self-dual codes. Des. Codes Cryptogr. 24(1), 15\u201336 (2001).","journal-title":"Des. Codes Cryptogr."},{"key":"1889_CR7","unstructured":"Chen H., Pan X., Xie C.: $$t$$-fold $$s$$-blocking sets and $$s$$-minimal codes. arXiv preprint (2025). arXiv:2512.09457."},{"issue":"3","key":"1889_CR8","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory A 25(3), 226\u2013241 (1978).","journal-title":"J. Comb. Theory A"},{"key":"1889_CR9","first-page":"1","volume":"5","author":"S Dodunekov","year":"1998","unstructured":"Dodunekov S., Simonis J.: Codes and projective multisets. Electron. J. Comb. 5, 1\u201323 (1998).","journal-title":"Electron. J. Comb."},{"issue":"2","key":"1889_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF01200904","volume":"17","author":"J Eisfeld","year":"1997","unstructured":"Eisfeld J., Metsch K.: Blocking $$s$$-dimensional subspaces by lines in $$\\operatorname{PG}(2s, q)$$. Combinatorica 17(2), 151\u2013162 (1997).","journal-title":"Combinatorica"},{"issue":"6","key":"1889_CR11","doi-asserted-by":"publisher","first-page":"1753","DOI":"10.1109\/18.340453","volume":"40","author":"GD Forney Jr","year":"1994","unstructured":"Forney G.D. Jr.: Density\/length profiles and trellis complexity of lattices. IEEE Trans. Inf. Theory 40(6), 1753\u20131772 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1889_CR12","doi-asserted-by":"publisher","first-page":"1741","DOI":"10.1109\/18.340452","volume":"40","author":"GD Forney Jr","year":"1994","unstructured":"Forney G.D. Jr.: Dimension\/length profiles and trellis complexity of linear block codes. IEEE Trans. Inf. Theory 40(6), 1741\u20131752 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1889_CR13","unstructured":"Govaerts P.: Classifications of blocking set related structures in Galois geometries. PhD Thesis, Ghent University (2003)."},{"issue":"5","key":"1889_CR14","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"JH Griesmer","year":"1960","unstructured":"Griesmer J.H.: A bound for error-correcting codes. IBM J. Res. Dev. 4(5), 532\u2013542 (1960).","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"1889_CR15","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/18.370144","volume":"41","author":"T Helleseth","year":"1995","unstructured":"Helleseth T., Klove T., Levenshtein V.I., Ytrehus \u00d8.: Bounds on the minimum support weights. IEEE Trans. Inf. Theory 41(2), 432\u2013440 (1995).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1889_CR16","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., Kl\u00f8ve T., Mykkeltveit J.: The weight distribution of irreducible cyclic codes with block lengths $$n_1\\left((q^l-1)n\\right)$$. Discret. Math. 18(2), 179\u2013211 (1977).","journal-title":"Discret. Math."},{"issue":"3","key":"1889_CR17","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1109\/18.135655","volume":"38","author":"T Helleseth","year":"1992","unstructured":"Helleseth T., Klove T., Ytrehus \u00d8.: Generalized Hamming weights of linear codes. IEEE Trans. Inf. Theory 38(3), 1133\u20131140 (1992).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1889_CR18","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1090\/conm\/632\/12627","volume-title":"Topics in Finite Fields, Contemporary Mathematics","author":"T Honold","year":"2015","unstructured":"Honold T., Kiermaier M., Kurz S.: Optimal binary subspace codes of length $$6$$, constant dimension $$3$$ and minimum distance $$4$$. In: Kyureghyan G., Mullen G.L., Pott A. (eds.) Topics in Finite Fields, Contemporary Mathematics, vol. 632, pp. 157\u2013172. American Mathematical Society, Providence (2015)."},{"issue":"1","key":"1889_CR19","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/18.179366","volume":"39","author":"T Kasami","year":"1993","unstructured":"Kasami T., Takata T., Fujiwara T., Lin S.: On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes. IEEE Trans. Inf. Theory 39(1), 242\u2013245 (1993).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1889_CR20","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0012-365X(78)90114-0","volume":"23","author":"T Kl\u00f8ve","year":"1978","unstructured":"Kl\u00f8ve T.: The weight distribution of linear codes over $$\\operatorname{GF} (q^l)$$ having generator matrix over $$\\operatorname{GF}(q)$$. Discret. Math. 23(2), 159\u2013168 (1978).","journal-title":"Discret. Math."},{"issue":"8","key":"1889_CR21","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R Koetter","year":"2008","unstructured":"Koetter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54(8), 3579\u20133591 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1889_CR22","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2410.07937","author":"B Kov\u00e1cs","year":"2025","unstructured":"Kov\u00e1cs B., Nagy Z.L., Szab\u00f3 D.R.: Blocking planes by lines in $$\\operatorname{PG}(n, q)$$. Des. Codes Cryptogr. (2025). https:\/\/doi.org\/10.48550\/arXiv.2410.07937.","journal-title":"Des. Codes Cryptogr."},{"key":"1889_CR23","unstructured":"Krotov D.S., Kurz S.: Generalized ovals, $$2.5$$-dimensional additive codes, and multispreads. arXiv preprint (2025). arXiv:2511.15843."},{"key":"1889_CR24","unstructured":"Kurz S.: Constructions and bounds for subspace codes. arXiv preprint (2021). arxiv:2112.11766."},{"key":"1889_CR25","unstructured":"Kurz S.: Divisible codes. arXiv preprint (2021). arXiv:2112.11763."},{"key":"1889_CR26","doi-asserted-by":"crossref","unstructured":"Kurz S.: Additive codes attaining the Griesmer bound. arXiv preprint (2024). arXiv:2412.14615.","DOI":"10.36227\/techrxiv.173603237.78033629\/v1"},{"issue":"1","key":"1889_CR27","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/TIT.2020.3021730","volume":"67","author":"F Li","year":"2020","unstructured":"Li F.: Weight hierarchies of a class of linear codes related to non-degenerate quadratic forms. IEEE Trans. Inf. Theory 67(1), 124\u2013129 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1889_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112718","volume":"345","author":"F Li","year":"2022","unstructured":"Li F., Li X.: Weight hierarchies of a family of linear codes associated with degenerate quadratic forms. Discret. Math. 345(3), 112718 (2022).","journal-title":"Discret. Math."},{"issue":"9","key":"1889_CR29","doi-asserted-by":"publisher","first-page":"5676","DOI":"10.1109\/TIT.2023.3277454","volume":"69","author":"C Liu","year":"2023","unstructured":"Liu C., Zheng D., Wang X.: Generalized hamming weights of linear codes from quadratic forms over finite fields of even characteristic. IEEE Trans. Inf. Theory 69(9), 5676\u20135686 (2023).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1889_CR30","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s00493-004-0028-5","volume":"24","author":"K Metsch","year":"2004","unstructured":"Metsch K.: Blocking subspaces by lines in $$\\operatorname{PG}(n, q)$$. Combinatorica 24(3), 459\u2013486 (2004).","journal-title":"Combinatorica"},{"key":"1889_CR31","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.jcta.2017.06.012","volume":"152","author":"EL N\u0103stase","year":"2017","unstructured":"N\u0103stase E.L., Sissokho P.A.: The maximum size of a partial spread in a finite projective space. J. Comb. Theory A 152, 353\u2013362 (2017).","journal-title":"J. Comb. Theory A"},{"key":"1889_CR32","volume-title":"Lectures on Modern Geometry, with an Appendix by Lucio Lombardo-Radice, Consiglio Nazionale delle Ricerche Monografie Matematiche","author":"B Segre","year":"1961","unstructured":"Segre B.: Lectures on Modern Geometry, with an Appendix by Lucio Lombardo-Radice, Consiglio Nazionale delle Ricerche Monografie Matematiche, vol. 7. Edizioni Cremonese, Rome (1961)."},{"key":"1889_CR33","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1515\/9783110642094-013","volume-title":"Combinatorics and Finite Fields: Difference Sets, Polynomials, Pseudorandomness and Applications","author":"J Sheekey","year":"2019","unstructured":"Sheekey J.: MRD codes: constructions and connections. In: Schmidt K.-U., Winterhof A. (eds.) Combinatorics and Finite Fields: Difference Sets, Polynomials, Pseudorandomness and Applications, vol. 23, pp. 255\u2013286. de Gruyter, Berlin (2019)."},{"issue":"2","key":"1889_CR34","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/S0019-9958(65)90080-X","volume":"8","author":"G Solomon","year":"1965","unstructured":"Solomon G., Stiffler J.J.: Algebraically punctured cyclic codes. Inf. Control 8(2), 170\u2013179 (1965).","journal-title":"Inf. Control"},{"issue":"6","key":"1889_CR35","doi-asserted-by":"publisher","first-page":"1564","DOI":"10.1109\/18.476213","volume":"41","author":"MA Tsfasman","year":"2002","unstructured":"Tsfasman M.A., Vl\u0103du\u0163 S.G.: Geometric approach to higher weights. IEEE Trans. Inf. Theory 41(6), 1564\u20131588 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1889_CR36","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1109\/18.133259","volume":"37","author":"VK Wei","year":"1992","unstructured":"Wei V.K.: Generalized Hamming weights for linear codes. IEEE Trans. Inf. Theory 37(5), 1412\u20131418 (1992).","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-026-01889-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-026-01889-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01889-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T01:41:29Z","timestamp":1784684489000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-026-01889-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,18]]},"references-count":36,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["1889"],"URL":"https:\/\/doi.org\/10.1007\/s10623-026-01889-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,18]]},"assertion":[{"value":"18 December 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"142"}}