{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:33Z","timestamp":1773377913909,"version":"3.50.1"},"reference-count":43,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849600","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1887-1891","source":"Crossref","is-referenced-by-count":9,"title":["On Decoding and Applications of Interleaved Goppa Codes"],"prefix":"10.1109","author":[{"given":"Lukas","family":"Holzbaur","sequence":"first","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich (TUM), Germany"}]},{"given":"Hedongliang","family":"Liu","sequence":"additional","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich (TUM), Germany"}]},{"given":"Sven","family":"Puchinger","sequence":"additional","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich (TUM), Germany"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich (TUM), Germany"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1147\/rd.45.0532"},{"key":"ref38","first-page":"107","article-title":"Decoding Random Linear Codes in $\\tilde O\\left({{2^{0.054n}}}\\right)$","author":"may","year":"2011","journal-title":"ASIACRYPT"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_42"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55589-8_7"},{"key":"ref31","article-title":"Generalization of the Ball-Collision Algorithm","author":"interlando","year":"2018"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55589-8_15"},{"key":"ref37","first-page":"520","article-title":"Decoding Random Binary Linear Codes in 2 n\/20: How 1+ 1= 0 Improves Information Set Decoding","author":"becker","year":"2012","journal-title":"Eurocrypt"},{"key":"ref36","article-title":"A Coding-Theoretic Approach to Cryptanalysis","author":"meurer","year":"2013","journal-title":"Ph D Dissertation"},{"key":"ref35","first-page":"203","article-title":"On Computing Nearest Neighbors With Applications to Decoding of Binary Linear Codes","author":"may","year":"2015","journal-title":"Eurocrypt"},{"key":"ref34","first-page":"115","article-title":"May-Ozerov Algorithm for Nearest-Neighbor Problem over ${{\\mathbb{F}}_q}$ and Its Application to Information Set Decoding","author":"hirose","year":"2016","journal-title":"SECITC"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021308"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/18.945244"},{"key":"ref11","first-page":"114","article-title":"A Public-Key Cryptosystem Based On Algebraic Coding Theory","volume":"44","author":"mceliece","year":"1978","journal-title":"The Deep Space Network Progress Report"},{"key":"ref12","article-title":"A Public-Key Cryptosystem from Interleaved Goppa Codes","author":"elleuch","year":"2018"},{"key":"ref13","article-title":"Personal Communication","author":"tillich","year":"2018"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055610"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19574-7_10"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620353"},{"key":"ref17","article-title":"List Decoding of Algebraic Codes","author":"nielsen","year":"2013","journal-title":"PhD diss Ph D thesis"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/20.617715"},{"key":"ref28","article-title":"Key reduction of McEliece&#x2019;s cryptosystem using list decoding","author":"barbier","year":"2011","journal-title":"IEEE ISIT"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)90090-X"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2270272"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25405-5_7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055350"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20901-7_4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089384"},{"key":"ref2","author":"macwilliams","year":"1978","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2243800"},{"key":"ref1","first-page":"207","article-title":"A new class of linear error correcting codes","volume":"6","author":"goppa","year":"1970","journal-title":"Problems of Information Transmission"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780563"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9728-9"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2574841"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.2140\/obs.2013.1.271"},{"key":"ref41","article-title":"Bounds on the Minimum Distance of Linear Codes and Quantum Codes","author":"grassl","year":"2007"},{"key":"ref23","article-title":"Algebraic List-Decoding of Error-Correcting Codes","author":"parvaresh","year":"2007","journal-title":"Ph D Dissertation"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.53757"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272036"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006549"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849600.pdf?arnumber=8849600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:33Z","timestamp":1773347733000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849600\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849600","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}