{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:48:34Z","timestamp":1775717314587,"version":"3.50.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1109\/tit.2024.3510874","type":"journal-article","created":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T19:03:48Z","timestamp":1733339028000},"page":"871-880","source":"Crossref","is-referenced-by-count":1,"title":["List-Decoding of AG Codes Without Genus Penalty"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1218-2422","authenticated-orcid":false,"given":"Peter","family":"Beelen","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics and Computer Science, Technical University of Denmark, Kongens Lyngby, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1226-3209","authenticated-orcid":false,"given":"Maria","family":"Montanucci","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Computer Science, Technical University of Denmark, Kongens Lyngby, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.32"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2010.4.485"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87448-5_3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3188843"},{"key":"ref5","article-title":"Faster list decoding of AG codes","author":"Beelen","year":"2023","journal-title":"arXiv:2304.07083"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.256518"},{"key":"ref7","first-page":"251","article-title":"Smooth embeddings for the Suzuki and ree curves","volume":"637","author":"Duursma","year":"2015","journal-title":"Algorithmic Arithmetic, Geometry, Coding Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.256485"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.179340"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1070\/IM1983v021n01ABEH001641"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743426"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0087993"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00181-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01810849"},{"key":"ref15","article-title":"Algebraic geometry codes","volume-title":"Handbook of Coding Theory","author":"Holdt","year":"1998"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.771253"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.476245"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306816"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.01.002"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2007.12.004"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3087604.3087642"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2424415"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(01)00509-2"},{"key":"ref24","article-title":"On decoding algorithms for algebraic geometry codes beyond half the minimum distance","author":"Panaccione","year":"2021"},{"key":"ref25","article-title":"Attaining Sudan\u2019s decoding radius with no genus penalty for algebraic geometry codes","author":"Panaccione","year":"2021","journal-title":"arXiv:2103.11188"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.45279"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2807478"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90039-K"},{"key":"ref29","volume-title":"Rational Points on Curves Over Finite Fields","volume":"18","author":"Serre","year":"2020"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.57204"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76878-4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.59945"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10851774\/10777606.pdf?arnumber=10777606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T06:06:20Z","timestamp":1737698780000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10777606\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":32,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3510874","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2]]}}}