{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T23:27:56Z","timestamp":1786490876699,"version":"3.56.0"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Research Foundation Flanders","doi-asserted-by":"publisher","award":["12A3Y25N"],"award-info":[{"award-number":["12A3Y25N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003827","name":"National Research Development and Innovation Office","doi-asserted-by":"publisher","award":["ADVANCED 153080"],"award-info":[{"award-number":["ADVANCED 153080"]}],"id":[{"id":"10.13039\/501100003827","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100001491","name":"Belgian American Educational Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100001491","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011019","name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012550","name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012550","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Finite Fields and Their Applications"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.ffa.2026.102871","type":"journal-article","created":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T10:56:35Z","timestamp":1782384995000},"page":"102871","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A note on short minimal codes from subgeometries"],"prefix":"10.1016","volume":"116","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0925-9305","authenticated-orcid":false,"given":"Sam","family":"Adriaensen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5323-0887","authenticated-orcid":false,"given":"Peter","family":"Sziklai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zsuzsa","family":"Weiner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/j.ffa.2026.102871_br0010","doi-asserted-by":"crossref","first-page":"5389","DOI":"10.1090\/tran\/9205","article-title":"Strong blocking sets and minimal codes from expander graphs","volume":"377","author":"Alon","year":"2024","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"10.1016\/j.ffa.2026.102871_br0020","doi-asserted-by":"crossref","first-page":"115","DOI":"10.3934\/amc.2020104","article-title":"A geometric characterization of minimal codes and their asymptotic performance","volume":"16","author":"Alfarano","year":"2022","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"10.1016\/j.ffa.2026.102871_br0030","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1137\/21M1391493","article-title":"Three combinatorial perspectives on minimal codes","volume":"36","author":"Alfarano","year":"2022","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"10.1016\/j.ffa.2026.102871_br0040","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1006\/ffta.1996.9999","article-title":"On the size of a double blocking set in PG(2,q)","volume":"2","author":"Ball","year":"1996","journal-title":"Finite Fields Appl."},{"issue":"2","key":"10.1016\/j.ffa.2026.102871_br0050","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10801-019-00930-6","article-title":"Minimal linear codes arising from blocking sets","volume":"53","author":"Bonini","year":"2021","journal-title":"J. Algebr. Comb."},{"issue":"2","key":"10.1016\/j.ffa.2026.102871_br0060","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1515\/forum-2020-0338","article-title":"On cutting blocking sets and their codes","volume":"34","author":"Bartoli","year":"2022","journal-title":"Forum Math."},{"key":"10.1016\/j.ffa.2026.102871_br0070","series-title":"Current Research Topics in Galois Geometry","first-page":"61","article-title":"Blocking sets in projective spaces","author":"Blokhuis","year":"2011"},{"issue":"3","key":"10.1016\/j.ffa.2026.102871_br0080","article-title":"Higgledy-piggledy sets in projective spaces of small dimension","volume":"29","author":"Denaux","year":"2022","journal-title":"Electron. J. Comb."},{"issue":"1","key":"10.1016\/j.ffa.2026.102871_br0090","doi-asserted-by":"crossref","first-page":"119","DOI":"10.3934\/amc.2011.5.119","article-title":"Linear nonbinary covering codes and saturating sets in projective spaces","volume":"5","author":"Davydov","year":"2011","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"10.1016\/j.ffa.2026.102871_br0100","article-title":"Lines in higgledy-piggledy arrangement","volume":"21","author":"Fancsali","year":"2014","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.ffa.2026.102871_br0110","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502951.001.0001","article-title":"Projective Geometries over Finite Fields","author":"Hirschfeld","year":"1998"},{"issue":"2","key":"10.1016\/j.ffa.2026.102871_br0120","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TIT.2021.3123730","article-title":"Short minimal codes and covering codes via strong blocking sets in projective spaces","volume":"68","author":"H\u00e9ger","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2026.102871_br0130","series-title":"Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory","first-page":"276","article-title":"Minimal codewords and secret sharing","author":"Massey","year":"1993"},{"key":"10.1016\/j.ffa.2026.102871_br0140","author":"Scotti"},{"issue":"3","key":"10.1016\/j.ffa.2026.102871_br0150","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1006\/ffta.1996.0176","article-title":"Blocking sets in Desarguesian affine and projective planes","volume":"3","author":"Sz\u0151nyi","year":"1997","journal-title":"Finite Fields Appl."},{"issue":"6","key":"10.1016\/j.ffa.2026.102871_br0160","doi-asserted-by":"crossref","first-page":"3690","DOI":"10.1109\/TIT.2021.3070377","article-title":"Full characterization of minimal linear codes as cutting blocking sets","volume":"67","author":"Tang","year":"2021","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Finite Fields and Their Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1071579726000821?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1071579726000821?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T22:33:55Z","timestamp":1786487635000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1071579726000821"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":16,"alternative-id":["S1071579726000821"],"URL":"https:\/\/doi.org\/10.1016\/j.ffa.2026.102871","relation":{},"ISSN":["1071-5797"],"issn-type":[{"value":"1071-5797","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A note on short minimal codes from subgeometries","name":"articletitle","label":"Article Title"},{"value":"Finite Fields and Their Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ffa.2026.102871","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102871"}}