{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T19:34:11Z","timestamp":1793129651496,"version":"4.5.0"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T00:00:00Z","timestamp":1433116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Digiteo Foundation through the IdealCodes Project"},{"name":"German Research Council","award":["BO 867\/22-1"],"award-info":[{"award-number":["BO 867\/22-1"]}]},{"name":"The Danish Council for Independent Research","award":["DFF-4002-00367"],"award-info":[{"award-number":["DFF-4002-00367"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/tit.2015.2424415","type":"journal-article","created":{"date-parts":[[2015,4,28]],"date-time":"2015-04-28T18:47:50Z","timestamp":1430246870000},"page":"3225-3240","source":"Crossref","is-referenced-by-count":28,"title":["Sub-Quadratic Decoding of One-Point Hermitian Codes"],"prefix":"10.1109","volume":"61","author":[{"given":"Johan S. R.","family":"Nielsen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Beelen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","author":"aho","year":"1974","journal-title":"The Design and Analysis of Computer Algorithms"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1006\/ffta.1995.1006"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.12.009"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.335973"},{"key":"ref35","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref34","author":"von zur gathen","year":"2012","journal-title":"Modern Computer Algebra"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-76878-4","author":"stichtenoth","year":"2009","journal-title":"Algebraic Function Fields and Codes"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0087995"},{"key":"ref12","author":"nielsen","year":"2014","journal-title":"Solving Generalised Padé Approximations Over Polynomial Rings"},{"key":"ref13","article-title":"List decoding of algebraic codes","author":"nielsen","year":"2013"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(02)00139-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2442829.2442881"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993931"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620353"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1142\/9789812794017_0002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860889"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.771253"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850097"},{"key":"ref27","article-title":"Unambiguous decoding of generalized Reed–Solomon codes beyond half the minimum distance","author":"zeh","year":"2012","journal-title":"Proc IZS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.476248"},{"key":"ref5","article-title":"Power decoding of Reed–Solomon codes revisited","author":"nielsen","year":"2014","journal-title":"Proceedings of ICMC"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00181-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.21267"},{"key":"ref7","author":"stein","year":"2015","journal-title":"SageMath Software V6 4"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"485","DOI":"10.3934\/amc.2010.4.485","article-title":"Efficient list decoding of a class of algebraic-geometry codes","volume":"4","author":"beelen","year":"2010","journal-title":"Adv Math Commun"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2007.12.004"},{"key":"ref9","article-title":"Interpolation and list decoding of algebraic codes","author":"brander","year":"2010"},{"key":"ref20","author":"cohn","year":"2010"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.817522"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.945273"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2060130"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.108255"},{"key":"ref26","first-page":"1","article-title":"Decoding interleaved Reed–Solomon and Hermitian codes with generalized divisions","author":"kampf","year":"2013","journal-title":"Proc of SCC"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s10623-012-9625-2","article-title":"Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension","volume":"70","author":"kampf","year":"2012","journal-title":"Designs Codes Cryptograph"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7109216\/07097025.pdf?arnumber=7097025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T21:25:21Z","timestamp":1691616321000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7097025\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":35,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2424415","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6]]}}}