{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:13:05Z","timestamp":1761808385819,"version":"3.37.3"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61671486"],"award-info":[{"award-number":["61671486"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"International Program for Ph.D. Candidates, Sun Yat-sen University"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1109\/tcomm.2020.3011991","type":"journal-article","created":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T21:14:58Z","timestamp":1595884498000},"page":"6012-6022","source":"Crossref","is-referenced-by-count":11,"title":["Low-Complexity Chase Decoding of Reed-Solomon Codes Using Module"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9238-7892","authenticated-orcid":false,"given":"Jiongyue","family":"Xing","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1725-1901","authenticated-orcid":false,"given":"Li","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3827-9065","authenticated-orcid":false,"given":"Martin","family":"Bossert","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"1999","author":"bossert","journal-title":"Channel Coding for Telecommunications","key":"ref39"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1016\/0196-6774(80)90013-9"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/18.312155"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1049\/iet-com.2015.0873"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/TCOMM.2012.100912.110834"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/TIT.2009.2039073"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1109\/TIT.1965.1053825"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1109\/18.817522"},{"key":"ref35","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":"175","author":"hasse","year":"1936","journal-title":"J Reine Angewandte Math"},{"key":"ref34","first-page":"305","article-title":"Algebraic chase decoding of Reed–Solomon codes using module minimisation","author":"chen","year":"2016","journal-title":"Proc IEEE Int Symp Inf Theory Appl (ISITA)"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/S0024-3795(01)00509-2"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1109\/ISIT.2019.8849232"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1016\/S0747-7171(85)80035-3"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1016\/j.jsc.2008.01.002"},{"key":"ref13","first-page":"2032","article-title":"An interpolation algorithm using Gröbner bases for soft-decision decoding of Reed–Solomon codes","author":"lee","year":"2006","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1016\/S0747-7171(02)00139-6"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/TIT.2005.850097"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1016\/j.jsc.2016.11.015"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TCS.1979.1084696"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1016\/0377-0427(92)90039-Z"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1137\/S0895479897326912"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1007\/s10623-014-9951-7"},{"year":"1986","author":"welch","article-title":"Error correction for algebraic block codes","key":"ref4"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TCOMM.2012.100912.110752"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1016\/S0019-9958(75)90090-X"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TIT.1972.1054746"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/TCOMM.2019.2927207"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/TIT.1966.1053873"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TIT.2003.819332"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/18.782097"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TIT.1969.1054260"},{"year":"1996","author":"k\u00f6tter","article-title":"On algebraic decoding of algebraic-geometric and cyclic codes","key":"ref9"},{"year":"1968","author":"berlekamp","journal-title":"Algebraic Coding Theory","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1145\/301250.301311"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/TIT.2015.2416068"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TIT.2011.2162160"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/TIT.2010.2096034"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/ITW.2003.1216682"},{"key":"ref26","first-page":"1","article-title":"Low-complexity Kotter-Vardy decoding of Reed–Solomon codes using module minimization","author":"xing","year":"2019","journal-title":"Proc IEEE Int Conf Commun (ICC)"},{"key":"ref25","first-page":"1986","article-title":"A complexity reducing transformation for the Lee-O’Sullivan interpolation algorithm","author":"ma","year":"2007","journal-title":"Proc IEEE Int Symp Inf Theory"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9226146\/09149706.pdf?arnumber=9149706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T19:04:39Z","timestamp":1667588679000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9149706\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":40,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2020.3011991","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2020,10]]}}}