{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T03:47:50Z","timestamp":1772941670623,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012154","name":"Graduate Research and Innovation Projects of Jiangsu Province","doi-asserted-by":"publisher","award":["KYCX25_0417"],"award-info":[{"award-number":["KYCX25_0417"]}],"id":[{"id":"10.13039\/501100012154","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371035"],"award-info":[{"award-number":["12371035"]}],"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,2]]},"DOI":"10.1016\/j.ffa.2025.102721","type":"journal-article","created":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T12:03:45Z","timestamp":1758110625000},"page":"102721","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["The dual codes of two families of BCH codes"],"prefix":"10.1016","volume":"110","author":[{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0002-0714-8628","authenticated-orcid":false,"given":"Haojie","family":"Xu","sequence":"first","affiliation":[]},{"given":"Xia","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Lu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0002-6950-8588","authenticated-orcid":false,"given":"Xiwang","family":"Cao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ffa.2025.102721_br0010","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0021-9800(69)80115-8","article-title":"New 5-designs","volume":"6","author":"Assmus","year":"1969","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.ffa.2025.102721_br0020","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1018014013461","article-title":"Almost MDS codes","volume":"9","author":"Boer","year":"1996","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.ffa.2025.102721_br0030","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.ffa.2003.08.004","article-title":"On xq+1+ax+b","volume":"10","author":"Bluher","year":"2004","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.ffa.2025.102721_br0040","doi-asserted-by":"crossref","first-page":"241","DOI":"10.4064\/aa-83-3-241-251","article-title":"Explicit evaluations of some Weil sums","volume":"83","author":"Coulter","year":"1998","journal-title":"Acta Arith."},{"key":"10.1016\/j.ffa.2025.102721_br0050","first-page":"171","article-title":"On the evaluation of a class of Weil sums in characteristic 2","volume":"28","author":"Coulter","year":"1999","journal-title":"N.Z. J. Math."},{"key":"10.1016\/j.ffa.2025.102721_br0060","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1109\/TIT.1975.1055435","article-title":"On subfield subcodes of modified Reed-Solomon codes (corresp.)","volume":"21","author":"Delsarte","year":"1975","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2025.102721_br0070","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."},{"key":"10.1016\/j.ffa.2025.102721_br0080","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1109\/18.567708","article-title":"Almost-MDS and near-MDS codes for error detection","volume":"43","author":"Dodunekova","year":"1997","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2025.102721_br0090","series-title":"Codes from Difference Sets","author":"Ding","year":"2015"},{"key":"10.1016\/j.ffa.2025.102721_br0100","series-title":"Designs from Linear Codes","author":"Ding","year":"2018"},{"key":"10.1016\/j.ffa.2025.102721_br0110","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.2025.102721_br0120","author":"Grassl"},{"key":"10.1016\/j.ffa.2025.102721_br0130","doi-asserted-by":"crossref","DOI":"10.1016\/j.ffa.2022.101996","article-title":"A class of almost MDS codes","volume":"79","author":"Geng","year":"2022","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.ffa.2025.102721_br0140","series-title":"Fundamentals of Error-Correcting Codes","author":"Huffman","year":"2003"},{"key":"10.1016\/j.ffa.2025.102721_br0150","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"},{"key":"10.1016\/j.ffa.2025.102721_br0160","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.2025.102721_br0170","doi-asserted-by":"crossref","DOI":"10.1016\/j.ffa.2021.101902","article-title":"Complete solution over Fpn of the equation Xpk+1+X+a=0","volume":"76","author":"Kim","year":"2021","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.ffa.2025.102721_br0180","doi-asserted-by":"crossref","first-page":"6899","DOI":"10.1109\/TIT.2024.3402745","article-title":"On \u2113-MDS codes and a conjecture on infinite families of 1-MDS codes","volume":"70","author":"Li","year":"2024","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2025.102721_br0190","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/j.1538-7305.1963.tb04003.x","article-title":"A theorem on the distribution of weights in a systematic code","volume":"42","author":"MacWilliams","year":"1963","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/j.ffa.2025.102721_br0200","doi-asserted-by":"crossref","DOI":"10.1016\/j.ffa.2025.102616","article-title":"Characterizations of NMDS codes and a proof of the Geng-Yang-Zhang-Zhou conjecture","volume":"105","author":"Qiang","year":"2025","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.ffa.2025.102721_br0210","series-title":"Handbook of Coding Theory","first-page":"1229","article-title":"Codes and designs","author":"Tonchev","year":"1998"},{"key":"10.1016\/j.ffa.2025.102721_br0220","series-title":"Handbook Combination Designs","first-page":"677","article-title":"Codes","author":"Tonchev","year":"2007"},{"key":"10.1016\/j.ffa.2025.102721_br0230","doi-asserted-by":"crossref","first-page":"3691","DOI":"10.1109\/TIT.2019.2959764","article-title":"Codes, differentially \u03b4-uniform functions, and t-designs","volume":"66","author":"Tang","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2025.102721_br0240","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"},{"key":"10.1016\/j.ffa.2025.102721_br0250","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"},{"key":"10.1016\/j.ffa.2025.102721_br0260","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/s12095-021-00546-3","article-title":"Some t-designs from BCH codes","volume":"14","author":"Xiang","year":"2022","journal-title":"Cryptogr. Commun."},{"key":"10.1016\/j.ffa.2025.102721_br0270","doi-asserted-by":"crossref","first-page":"4206","DOI":"10.1109\/TIT.2025.3535700","article-title":"The sufficient and necessary conditions for the minimum distance of the BCH code C(q,q+1,3,h) to be 3 and 4","volume":"71","author":"Xu","year":"2025","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2025.102721_br0280","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.2025.102721_br0290","series-title":"2009 IEEE International Conference on Network Infrastructure and Digital Content","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:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1071579725001510?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1071579725001510?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T11:13:04Z","timestamp":1772881984000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1071579725001510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":29,"alternative-id":["S1071579725001510"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.ffa.2025.102721","relation":{},"ISSN":["1071-5797"],"issn-type":[{"value":"1071-5797","type":"print"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The dual codes of two families of BCH codes","name":"articletitle","label":"Article Title"},{"value":"Finite Fields and Their Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.ffa.2025.102721","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"102721"}}