{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T10:18:54Z","timestamp":1783160334227,"version":"3.54.6"},"reference-count":55,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["JZ2024HGTB0203"],"award-info":[{"award-number":["JZ2024HGTB0203"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013804","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171134"],"award-info":[{"award-number":["12171134"]}],"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":["U21A20428"],"award-info":[{"award-number":["U21A20428"]}],"id":[{"id":"10.13039\/501100001809","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,9]]},"DOI":"10.1016\/j.ffa.2026.102844","type":"journal-article","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:04:28Z","timestamp":1778249068000},"page":"102844","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The extended codes of NMDS codes"],"prefix":"10.1016","volume":"114","author":[{"given":"Qian","family":"Ma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoshan","family":"Kai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shixin","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ffa.2026.102844_br0010","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.disc.2004.05.021","article-title":"Near-MDS codes arising from algebraic curves","volume":"301","author":"Abatangelo","year":"2005","journal-title":"Discrete Math."},{"key":"10.1016\/j.ffa.2026.102844_br0020","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10623-007-9144-8","article-title":"Elliptic near-MDS codes over F5","volume":"46","author":"Abatangelo","year":"2008","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"10.1016\/j.ffa.2026.102844_br0030","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1007\/s10623-021-00852-0","article-title":"Near-MDS codes from elliptic curves","volume":"89","author":"Aguglia","year":"2021","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.ffa.2026.102844_br0040","series-title":"Finite Geometry and Combinatorial Applications","author":"Ball","year":"2015"},{"key":"10.1016\/j.ffa.2026.102844_br0050","doi-asserted-by":"crossref","first-page":"733","DOI":"10.4171\/jems\/316","article-title":"On large subsets of a finite vector space in which every subset of basis size is a basis","volume":"14","author":"Ball","year":"2012","journal-title":"J. Eur. Math. Soc."},{"issue":"1\u20132","key":"10.1016\/j.ffa.2026.102844_br0060","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10623-012-9658-6","article-title":"On sets of vectors of a finite vector space in which every subset of basis size is a basis II","volume":"65","author":"Ball","year":"2012","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"10.1016\/j.ffa.2026.102844_br0070","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1109\/TIT.2014.2385084","article-title":"On the covering radius of MDS codes","volume":"61","author":"Bartoli","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2026.102844_br0080","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10623-015-0073-7","article-title":"Complete (k,3)-arcs from quartic curves","volume":"79","author":"Bartoli","year":"2016","journal-title":"Des. Codes Cryptogr."},{"issue":"3\u20134","key":"10.1016\/j.ffa.2026.102844_br0090","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","article-title":"The Magma algebra system I: the user language","volume":"24","author":"Bosma","year":"1997","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.ffa.2026.102844_br0100","series-title":"IEEE Int. Symp. Netw. Coding","first-page":"1","article-title":"An upper bound on the size of locally recoverable codes","author":"Cadambe","year":"2013"},{"key":"10.1016\/j.ffa.2026.102844_br0110","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1090\/S0002-9939-1952-0049940-6","article-title":"A theorem of Dickson on irreducible polynomials","volume":"3","author":"Carlitz","year":"1952","journal-title":"Proc. Am. Math. Soc."},{"key":"10.1016\/j.ffa.2026.102844_br0120","first-page":"31","article-title":"The number of irreducible polynomials over GF(2) with given trace and subtrace","volume":"47","author":"Cattell","year":"2003","journal-title":"J. Comb. Math. Comb. Comput."},{"issue":"3","key":"10.1016\/j.ffa.2026.102844_br0130","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1007\/s10623-022-01141-0","article-title":"On near-MDS codes and caps","volume":"91","author":"Ceria","year":"2023","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"10.1016\/j.ffa.2026.102844_br0140","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1018014013461","article-title":"Almost MDS codes","volume":"9","author":"De Boer","year":"1996","journal-title":"Des. Codes Cryptogr."},{"issue":"9","key":"10.1016\/j.ffa.2026.102844_br0150","doi-asserted-by":"crossref","first-page":"5419","DOI":"10.1109\/TIT.2020.2990396","article-title":"Infinite families of near MDS codes holding t-designs","volume":"66","author":"Ding","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2026.102844_br0160","doi-asserted-by":"crossref","DOI":"10.1016\/j.ffa.2024.102495","article-title":"Four new families of NMDS codes with dimension 4 and their applications","volume":"99","author":"Ding","year":"2024","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.ffa.2026.102844_br0170","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/BF01222850","article-title":"On near-MDS codes","volume":"54","author":"Dodunekov","year":"1995","journal-title":"J. Geom."},{"issue":"1\u20133","key":"10.1016\/j.ffa.2026.102844_br0180","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0012-365X(94)90256-9","article-title":"On the covering radius of Reed-Solomon codes","volume":"126","author":"D\u00fcr","year":"1994","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.ffa.2026.102844_br0190","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008247720662","article-title":"Codes of small defect","volume":"10","author":"Faldum","year":"1997","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.ffa.2026.102844_br0200","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10623-023-01313-6","article-title":"New classes of NMDS codes with dimension 3","volume":"92","author":"Fan","year":"2024","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"10.1016\/j.ffa.2026.102844_br0210","doi-asserted-by":"crossref","first-page":"988","DOI":"10.1016\/j.ffa.2006.09.007","article-title":"On the completeness of certain n-tracks arising from elliptic curves","volume":"13","author":"Giulietti","year":"2007","journal-title":"Finite Fields Appl."},{"issue":"11","key":"10.1016\/j.ffa.2026.102844_br0220","doi-asserted-by":"crossref","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","article-title":"On the locality of codeword symbols","volume":"58","author":"Gopalan","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"10.1016\/j.ffa.2026.102844_br0230","doi-asserted-by":"crossref","first-page":"5670","DOI":"10.1109\/TIT.2023.3272384","article-title":"Roth-Lempel NMDS codes of non-elliptic-curve type","volume":"69","author":"Han","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"10.1016\/j.ffa.2026.102844_br0240","doi-asserted-by":"crossref","first-page":"7817","DOI":"10.1109\/TIT.2022.3194914","article-title":"Constructions of MDS, near MDS and almost MDS codes from cyclic subgroups of Fq2\u204e","volume":"68","author":"Heng","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"10.1016\/j.ffa.2026.102844_br0250","doi-asserted-by":"crossref","first-page":"6872","DOI":"10.1109\/TIT.2020.3006846","article-title":"Two families of optimal linear codes and their subfield codes","volume":"66","author":"Heng","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"10.1016\/j.ffa.2026.102844_br0260","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113538","article-title":"New infinite families of near MDS codes holding t-designs","volume":"346","author":"Heng","year":"2023","journal-title":"Discrete Math."},{"key":"10.1016\/j.ffa.2026.102844_br0270","doi-asserted-by":"crossref","DOI":"10.1016\/j.ffa.2023.102208","article-title":"Constructions of cyclic codes and extended primitive cyclic codes with their applications","volume":"89","author":"Heng","year":"2023","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.ffa.2026.102844_br0280","series-title":"Arithmetic of Finite Fields","article-title":"Near MDS codes with dimension 4 and their application in locally recoverable codes","volume":"vol. 13638","author":"Heng","year":"2023"},{"key":"10.1016\/j.ffa.2026.102844_br0290","series-title":"Finite Geometries","article-title":"The packing problem in statistics, coding theory and finite projective spaces: update 2000","volume":"vol. 3","author":"Hirschfeld","year":"2001"},{"key":"10.1016\/j.ffa.2026.102844_br0300","doi-asserted-by":"crossref","first-page":"5079","DOI":"10.1007\/s10623-025-01709-6","article-title":"New MDS and self-dual generalized Roth-Lempel codes as well as their deep holes","volume":"93","author":"Li","year":"2025","journal-title":"Des. Codes Cryptogr."},{"issue":"12","key":"10.1016\/j.ffa.2026.102844_br0310","doi-asserted-by":"crossref","first-page":"8562","DOI":"10.1109\/TIT.2024.3449921","article-title":"Self-orthogonal codes from p-divisible codes","volume":"70","author":"Li","year":"2024","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2026.102844_br0320","doi-asserted-by":"crossref","DOI":"10.1016\/j.ffa.2023.102184","article-title":"Constructions of near MDS codes which are optimal locally recoverable codes","volume":"88","author":"Li","year":"2023","journal-title":"Finite Fields Appl."},{"issue":"3","key":"10.1016\/j.ffa.2026.102844_br0330","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/s12095-022-00619-x","article-title":"A construction of optimal locally recoverable codes","volume":"15","author":"Li","year":"2023","journal-title":"Cryptogr. Commun."},{"key":"10.1016\/j.ffa.2026.102844_br0340","series-title":"Finite Fields","first-page":"775","volume":"vol. 20","author":"Lidl","year":"1997"},{"issue":"4","key":"10.1016\/j.ffa.2026.102844_br0350","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1109\/18.992802","article-title":"NMDS codes of maximum length over Fq, 8\u2264q\u226411","volume":"48","author":"Marcugini","year":"2002","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2026.102844_br0360","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.ffa.2014.04.003","article-title":"The number of irreducible polynomials over finite fields of characteristic 2 with given trace and subtrace","volume":"29","author":"Ri","year":"2014","journal-title":"Finite Fields Appl."},{"issue":"6","key":"10.1016\/j.ffa.2026.102844_br0370","doi-asserted-by":"crossref","first-page":"1314","DOI":"10.1109\/18.45291","article-title":"On MDS codes via Cauchy matrices","volume":"35","author":"Roth","year":"1989","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10.1016\/j.ffa.2026.102844_br0380","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1109\/18.30988","article-title":"A construction of non-Reed-Solomon type MDS codes","volume":"35","author":"Roth","year":"1989","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2026.102844_br0390","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1137\/S0895480100368050","article-title":"The number of irreducible polynomials and Lyndon words with given trace","volume":"14","author":"Ruskey","year":"2001","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"10.1016\/j.ffa.2026.102844_br0400","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02410779","article-title":"Curve razionali normali ek-archi negli spazi finiti","volume":"39","author":"Segre","year":"1955","journal-title":"Ann. Mat. Pura Appl."},{"key":"10.1016\/j.ffa.2026.102844_br0410","series-title":"The 18th International Conference on Applications of Computer Algebra (AC'12)","article-title":"NMDS codes and their secret-sharing schemes","author":"Simos","year":"2012"},{"issue":"7","key":"10.1016\/j.ffa.2026.102844_br0420","doi-asserted-by":"crossref","first-page":"4808","DOI":"10.1109\/TIT.2023.3342216","article-title":"The extended codes of a family of reversible MDS cyclic codes","volume":"70","author":"Sun","year":"2024","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"10.1016\/j.ffa.2026.102844_br0430","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.114080","article-title":"The extended codes of projective two-weight codes","volume":"347","author":"Sun","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.ffa.2026.102844_br0440","doi-asserted-by":"crossref","DOI":"10.1016\/j.ffa.2024.102401","article-title":"The extended codes of some linear codes","volume":"96","author":"Sun","year":"2024","journal-title":"Finite Fields Appl."},{"issue":"1","key":"10.1016\/j.ffa.2026.102844_br0450","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10623-022-01099-z","article-title":"The minimum locality of linear codes","volume":"91","author":"Tan","year":"2023","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"10.1016\/j.ffa.2026.102844_br0460","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/TIT.2020.3032600","article-title":"An infinite family of linear codes supporting 4-designs","volume":"67","author":"Tang","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10.1016\/j.ffa.2026.102844_br0470","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2020.112277","article-title":"Near MDS codes from oval polynomials","volume":"344","author":"Wang","year":"2021","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.ffa.2026.102844_br0480","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1109\/TIT.2024.3494813","article-title":"When does the extended code of an MDS code remain MDS?","volume":"71","author":"Wu","year":"2025","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2026.102844_br0490","author":"Wu"},{"issue":"7","key":"10.1016\/j.ffa.2026.102844_br0500","doi-asserted-by":"crossref","first-page":"4344","DOI":"10.1109\/TIT.2022.3157199","article-title":"Infinite families of 3-designs and 2-designs from almost MDS codes","volume":"68","author":"Xu","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"10.1016\/j.ffa.2026.102844_br0510","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113490","article-title":"Near MDS codes of non-elliptic-curve type from Reed-Solomon codes","volume":"346","author":"Xu","year":"2023","journal-title":"Discrete Math."},{"key":"10.1016\/j.ffa.2026.102844_br0520","doi-asserted-by":"crossref","DOI":"10.1016\/j.ffa.2023.102338","article-title":"Near-MDS codes from maximal arcs in PG(2, q)","volume":"93","author":"Xu","year":"2024","journal-title":"Finite Fields Appl."},{"issue":"7","key":"10.1016\/j.ffa.2026.102844_br0530","doi-asserted-by":"crossref","first-page":"4365","DOI":"10.1109\/TIT.2022.3156072","article-title":"Infinite families of linear codes supporting more t-designs","volume":"68","author":"Yan","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2026.102844_br0540","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.ffa.2005.04.006","article-title":"Irreducible polynomials over finite fields with prescribed trace\/prescribed constant term","volume":"12","author":"Yucas","year":"2006","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.ffa.2026.102844_br0550","series-title":"Proceedings of the IC-NIDC","first-page":"833","article-title":"A secret sharing scheme based on near-MDS codes","author":"Zhou","year":"2009"}],"container-title":["Finite Fields and Their Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1071579726000559?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1071579726000559?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T09:57:19Z","timestamp":1783159039000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1071579726000559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":55,"alternative-id":["S1071579726000559"],"URL":"https:\/\/doi.org\/10.1016\/j.ffa.2026.102844","relation":{},"ISSN":["1071-5797"],"issn-type":[{"value":"1071-5797","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The extended codes of NMDS codes","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.102844","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":"102844"}}