{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T15:43:49Z","timestamp":1776872629863,"version":"3.51.2"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Finite Fields and Their Applications"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ffa.2026.102832","type":"journal-article","created":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T17:36:09Z","timestamp":1775669769000},"page":"102832","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Decoding GAG codes beyond half the \u00d6zbudak\u2013Stichtenoth bound"],"prefix":"10.1016","volume":"113","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1266-6702","authenticated-orcid":false,"given":"Engin","family":"\u015eenel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ffa.2026.102832_br0010","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1109\/TIT.2024.3510874","article-title":"List-decoding of AG codes without genus penalty","volume":"71","author":"Beelen","year":"2025","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"10.1016\/j.ffa.2026.102832_br0020","doi-asserted-by":"crossref","first-page":"2638","DOI":"10.1109\/18.887873","article-title":"Some new codes from algebraic curves","volume":"46","author":"Ding","year":"2000","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2026.102832_br0030","series-title":"List decoding for noisy channels","author":"Elias","year":"1957"},{"key":"10.1016\/j.ffa.2026.102832_br0040","series-title":"Proc. 39th Annu. Symp. Found. Comput. Sci.","first-page":"28","article-title":"Improved decoding of Reed-Solomon and algebraic-geometric codes","author":"Guruswami","year":"1998"},{"key":"10.1016\/j.ffa.2026.102832_br0050","series-title":"Proc. Annu. IEEE Conf. Comput. Complex","first-page":"300","article-title":"List decoding with side information","author":"Guruswami","year":"2003"},{"issue":"3","key":"10.1016\/j.ffa.2026.102832_br0060","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S1071-5797(02)00017-5","article-title":"Sudan-decoding generalized geometric Goppa codes","volume":"9","author":"Heydtmann","year":"2003","journal-title":"Finite Fields Appl."},{"issue":"6","key":"10.1016\/j.ffa.2026.102832_br0070","doi-asserted-by":"crossref","first-page":"2763","DOI":"10.1081\/AGB-120003988","article-title":"Generalized geometric Goppa codes","volume":"30","author":"Heydtmann","year":"2002","journal-title":"Commun. Algebra"},{"key":"10.1016\/j.ffa.2026.102832_br0080","series-title":"IEEE Int. Symp. Inf. Theory - Proc.","first-page":"1130","article-title":"Good codes from generalised algebraic geometry codes","author":"Jibril","year":"2010"},{"key":"10.1016\/j.ffa.2026.102832_br0090","author":"Matsumoto"},{"issue":"7","key":"10.1016\/j.ffa.2026.102832_br0100","doi-asserted-by":"crossref","first-page":"2502","DOI":"10.1109\/18.796391","article-title":"Constructing codes from algebraic curves","volume":"45","author":"\u00d6zbudak","year":"1999","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"10.1016\/j.ffa.2026.102832_br0110","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1016\/j.jpaa.2012.10.004","article-title":"New lower bounds for the minimum distance of generalized algebraic geometry codes","volume":"217","author":"Picone","year":"2013","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/j.ffa.2026.102832_br0120","first-page":"241","article-title":"Decoding algebraic-geometric codes beyond the error-correction bound","author":"Shokrollahi","year":"1998","journal-title":"Conf. Proc. Annu. ACM Symp. Theory Comput."},{"issue":"2","key":"10.1016\/j.ffa.2026.102832_br0130","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10623-004-3993-1","article-title":"Asymptotically good codes from generalized algebraic-geometry codes","volume":"37","author":"Spera","year":"2005","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.ffa.2026.102832_br0140","series-title":"Algebraic Function Fields and Codes","author":"Stichtenoth","year":"2009"},{"issue":"3","key":"10.1016\/j.ffa.2026.102832_br0160","first-page":"221","article-title":"On a relation between GAG codes and AG codes","volume":"31","author":"\u015eenel","year":"2023","journal-title":"An. \u015etiin\u0163. Univ. \u2018Ovidius\u2019 Constan\u0163a"},{"key":"10.1016\/j.ffa.2026.102832_br0170","series-title":"List Decoding","author":"Wozencraft","year":"1958"},{"issue":"7","key":"10.1016\/j.ffa.2026.102832_br0180","doi-asserted-by":"crossref","first-page":"2498","DOI":"10.1109\/18.796390","article-title":"A generalization of algebraic-geometry codes","volume":"45","author":"Xing","year":"1999","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:S1071579726000432?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1071579726000432?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T14:50:53Z","timestamp":1776869453000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1071579726000432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":17,"alternative-id":["S1071579726000432"],"URL":"https:\/\/doi.org\/10.1016\/j.ffa.2026.102832","relation":{},"ISSN":["1071-5797"],"issn-type":[{"value":"1071-5797","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Decoding GAG codes beyond half the \u00d6zbudak\u2013Stichtenoth bound","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.102832","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":"102832"}}