{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:56:13Z","timestamp":1766066173173,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034253","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"835-839","source":"Crossref","is-referenced-by-count":13,"title":["On the decoding complexity of cyclic codes up to the BCH bound"],"prefix":"10.1109","author":[{"given":"Davide","family":"Schipani","sequence":"first","affiliation":[]},{"given":"Michele","family":"Elia","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Rosenthal","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.412677"},{"journal-title":"Modern Computer Algebra","year":"1999","author":"von zur gathen","key":"ref11"},{"journal-title":"Shift Register Sequences","year":"1982","author":"golomb","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93806-4_12"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/26.403765"},{"journal-title":"Finite Fields Structure and Arithmetics","year":"1993","author":"jungnickel","key":"ref15"},{"key":"ref16","article-title":"The Art of Computer Programming","volume":"ii","author":"knuth","year":"1981","journal-title":"Seminumerical Algorithms"},{"journal-title":"Finite Fields","year":"1997","author":"lidl","key":"ref17"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"journal-title":"Error Control Systems for Digital Communication and Storage","year":"1995","author":"wicker","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1981-0606517-5"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1090\/pspum\/020\/0316385","article-title":"Class number, a theory of factorization and genera","author":"shanks","year":"1971","journal-title":"Proc Symp Pure Math AMS Providence R I"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800467"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/12.990131"},{"journal-title":"Reed-Solomon Codes and Their Applications","year":"1994","author":"wicker","key":"ref29"},{"key":"ref5","first-page":"150","article-title":"Algebraic Decoding of the (23, 12, 7) Golay Code","volume":"it 33","author":"elia","year":"1981","journal-title":"IEEE Trans on Information Theory"},{"journal-title":"Improvements on Cantor-Zassenhaus Factorization Algorithm","year":"2010","author":"elia","key":"ref8"},{"journal-title":"Polynomial evaluation over finite fields new algorithms and complexity bounds","year":"2011","author":"elia","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1981.37"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.104340"},{"journal-title":"Algebraic Coding Theory","year":"1968","author":"berlekamp","key":"ref1"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1983-2","author":"mceliece","year":"1987","journal-title":"Finite Fields for Computer Scientists and Engineers"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2004.12.027"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93806-4_5"},{"key":"ref24","volume":"i","author":"pless","year":"1998","journal-title":"Handbook of Coding Theory"},{"journal-title":"Error-Correcting Codes","year":"1981","author":"peterson","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/AUSCTW.2011.5728754"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.135639"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034253.pdf?arnumber=6034253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T07:35:23Z","timestamp":1497944123000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034253\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034253","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}