{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:54Z","timestamp":1772283534275,"version":"3.50.1"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001804","name":"Canada Research Chairs","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001804","id-type":"DOI","asserted-by":"publisher"}]},{"name":"International Mobility Grant Explo\u2019ra Doc through the R\u00e9gion Rh\u00f4ne-Alpes"},{"name":"ANR through the HPAC project","award":["ANR 11 BS02 013"],"award-info":[{"award-number":["ANR 11 BS02 013"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/tit.2015.2416068","type":"journal-article","created":{"date-parts":[[2015,3,23]],"date-time":"2015-03-23T14:42:23Z","timestamp":1427121743000},"page":"2370-2387","source":"Crossref","is-referenced-by-count":24,"title":["Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations"],"prefix":"10.1109","volume":"61","author":[{"given":"Muhammad F. I.","family":"Chowdhury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude-Pierre","family":"Jeannerod","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Neiger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Schost","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Villard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0129-8"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301311"},{"key":"ref33","article-title":"The Guruswami–Sudan decoding algorithm for Reed–Solomon codes","author":"mceliece","year":"2003"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.01.002"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.490540"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-57189-3_20"},{"key":"ref36","article-title":"List decoding of algebraic codes","author":"nielsen","year":"2013"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1980.1171074"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-11607-9_3","article-title":"The construction of multivariate polynomials with preassigned zeros","volume":"144","author":"m\u00f6ller","year":"1982","journal-title":"Computer Algebra"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.819332"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2096034"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2003.1216682"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(92)90039-Z"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850097"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860889"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.09.006"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1515\/crll.1936.175.50","article-title":"Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik","volume":"1936","author":"hasse","year":"1936","journal-title":"J reine angew Math"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54522-0_93"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/190347.190431"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2053901"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"ref55","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","article-title":"Probabilistic algorithms for sparse polynomials","volume":"72","author":"zippel","year":"1979","journal-title":"Symbolic and Algebraic Computation"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162160"},{"key":"ref53","article-title":"Algebraic soft- and hard-decision decoding of generalized Reed–Solomon and cyclic codes","author":"zeh","year":"2013"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926355"},{"key":"ref10","article-title":"Multivariate list decoding of evaluation codes with a Gröbner basis perspective","author":"busse","year":"2008"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178683"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.29"},{"key":"ref12","article-title":"On the complexity of multivariate interpolation with multiplicities and of simultaneous polynomial approximations","author":"chowdhury","year":"0"},{"key":"ref13","first-page":"298","article-title":"Ideal forms of Coppersmith’s theorem and Guruswami–Sudan list decoding","author":"cohn","year":"2011","journal-title":"Proc of Innovations in Computer Science"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2140\/obs.2013.1.271"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.133246"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261691"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.03.010"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479892230031"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-642-25405-5_13","article-title":"Simplified high-speed high-distance list decoding for alternant codes","volume":"7071","author":"bernstein","year":"2011","journal-title":"Post-Quantum Cryptography"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2243800"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(80)90161-5"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"ref9","article-title":"Interpolation and list decoding of algebraic codes","author":"brander","year":"2010"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/120694.120697"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"ref48","article-title":"On the complexity of matrix multiplication","author":"stothers","year":"2010"},{"key":"ref47","first-page":"6271","article-title":"Notes on computing minimal approximant bases","author":"storjohann","year":"2006","journal-title":"Proc Challenges Symbolic Comput Softw"},{"key":"ref42","author":"roth","year":"2007","journal-title":"Introduction to Coding Theory"},{"key":"ref41","article-title":"Algorithme LLL polynomial et applications","author":"reinhard","year":"2003"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993931"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/18.817522"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7088688\/07065276.pdf?arnumber=7065276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:51:21Z","timestamp":1641988281000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7065276\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":55,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2416068","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5]]}}}