{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:32Z","timestamp":1773377612316,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9173983","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"298-302","source":"Crossref","is-referenced-by-count":0,"title":["Low-Complexity Chase Decoding of Reed-Solomon Codes through Basis Reduction"],"prefix":"10.1109","author":[{"given":"Jiongyue","family":"Xing","sequence":"first","affiliation":[{"name":"Sun Yat-sen University,School of Electronics and Information Technology,Guangzhou,China"}]},{"given":"Li","family":"Chen","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University,School of Electronics and Information Technology,Guangzhou,China"}]},{"given":"Martin","family":"Bossert","sequence":"additional","affiliation":[{"name":"Ulm University,Institute of Communications Engineering,Ulm,Germany"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.01.002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(02)00139-6"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761514"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2927207"},{"key":"ref14","first-page":"310","article-title":"Algebraic Chase decoding of Reed-Solomon codes using module minimisation","author":"chen","year":"2016","journal-title":"Proc Int Symp Inf Theory and Its App (ISITA)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053825"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.312155"},{"key":"ref4","article-title":"On algebraic decoding of algebraic-geometric and cyclic codes","author":"koetter","year":"1996","journal-title":"PhD thesis"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.819332"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.100912.110752"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2096034"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1109\/TVLSI.2008.2005575","article-title":"Backward interpolation architecture for algebraic soft-decision Reed-Solomon decoding","volume":"17","author":"zhu","year":"2009","journal-title":"IEEE Trans Very Large Scale Integr Syst"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2039073"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2015.0873"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09173983.pdf?arnumber=9173983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:36Z","timestamp":1773347676000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9173983\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9173983","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}