{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T06:54:44Z","timestamp":1720680884222},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (NSFC)","doi-asserted-by":"publisher","award":["61372079"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2012CB316100"],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Physical Communication"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1016\/j.phycom.2016.06.001","type":"journal-article","created":{"date-parts":[[2016,6,12]],"date-time":"2016-06-12T10:59:53Z","timestamp":1465729193000},"page":"48-60","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Algebraic soft decoding of Reed\u2013Solomon codes with improved progressive interpolation"],"prefix":"10.1016","volume":"20","author":[{"given":"Yi","family":"Lyu","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1725-1901","authenticated-orcid":false,"given":"Li","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.phycom.2016.06.001_br000005","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","article-title":"Shift register synthesis and BCH decoding","volume":"15","author":"Massey","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.phycom.2016.06.001_br000010","unstructured":"L. Welch, E.R. Berlekamp, Error correction for algebraic block codes, in: Proc. IEEE Int. Symp. Inform. Theory, 1983."},{"issue":"4","key":"10.1016\/j.phycom.2016.06.001_br000015","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0020-0190(92)90195-2","article-title":"Highly resilient correctors for multivariate polynomials","volume":"43","author":"Gemmell","year":"1992","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/j.phycom.2016.06.001_br000020","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1006\/jcom.1997.0439","article-title":"Decoding of Reed Solomon codes beyond the error-correction bound","volume":"13","author":"Sudan","year":"1997","journal-title":"J. Complexity"},{"issue":"6","key":"10.1016\/j.phycom.2016.06.001_br000025","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/18.782097","article-title":"Improved decoding of Reed-Solomon and algebraic-geometric codes","volume":"45","author":"Guruswami","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"10.1016\/j.phycom.2016.06.001_br000030","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1109\/TIT.2003.819332","article-title":"Algebraic soft-decision decoding of Reed-Solomon codes","volume":"49","author":"Koetter","year":"2003","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.phycom.2016.06.001_br000035","series-title":"Linkoping Studies in Science and Technology, no. 419","article-title":"On algebraic decoding of algebraic-geometric and cyclic codes","author":"Koetter","year":"1996"},{"issue":"3","key":"10.1016\/j.phycom.2016.06.001_br000040","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/18.490540","article-title":"Fast generalized minimum-distance decoding of algebraic-geometric and Reed-Solomon codes","volume":"42","author":"Koetter","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.phycom.2016.06.001_br000045","unstructured":"R. McEliece, The Guruswami-Sudan decoding for Reed-Solomon codes, IPN Progress Report, pp. 42\u2013153, May 2003."},{"issue":"2","key":"10.1016\/j.phycom.2016.06.001_br000050","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1049\/iet-com:20060057","article-title":"Performance of Reed-Solomon codes using the Guruswami-Sudan algorithm with improved interpolation efficiency","volume":"1","author":"Chen","year":"2007","journal-title":"IET Proc. Commun."},{"issue":"3","key":"10.1016\/j.phycom.2016.06.001_br000055","first-page":"68","article-title":"Low-complexity soft-decoding algorithms for Reed-Solomon codes\u2014Part I: An algebraic soft-in hard-out Chase decoder","volume":"56","author":"Bellorado","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"10.1016\/j.phycom.2016.06.001_br000060","doi-asserted-by":"crossref","first-page":"3611","DOI":"10.1109\/TIT.2008.926355","article-title":"New list decoding algorithm for Reed-Solomon and BCH codes","volume":"54","author":"Wu","year":"2008","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.phycom.2016.06.001_br000065","doi-asserted-by":"crossref","unstructured":"R. Koetter, J. Ma, A. Vardy, A. Ahmed, Efficient interpolation and factorizaton in algebraic soft-decision decoding of Reed-Solomon codes, in: Proc. IEEE Int. Symp. Inform. Theory, Yokohama, Japan, Jun.-Jul. 2003.","DOI":"10.1109\/ISIT.2003.1228381"},{"key":"10.1016\/j.phycom.2016.06.001_br000070","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1023\/B:VLSI.0000047274.68702.8d","article-title":"Towards a VLSI architecture for interpolation-based soft-decision Reed-Solomon decoders","volume":"39","author":"Gross","year":"2005","journal-title":"J. VLSI Signal Process."},{"issue":"2","key":"10.1016\/j.phycom.2016.06.001_br000075","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1109\/TIT.2010.2096034","article-title":"The re-encoding transformation in algebraic list-decoding of Reed-Solomon codes","volume":"57","author":"Koetter","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.phycom.2016.06.001_br000080","doi-asserted-by":"crossref","unstructured":"K. Lee, M. O\u2019Sullivan, An interpolation algorithm using Gr\u00f6bner bases for soft-decision decoding of Reed-Solomon codes, in: Proc. IEEE Int. Symp. Inform. Theory, ISIT, Seattle, USA, Jul. 2006.","DOI":"10.1109\/ISIT.2006.261906"},{"issue":"9","key":"10.1016\/j.phycom.2016.06.001_br000085","doi-asserted-by":"crossref","first-page":"4341","DOI":"10.1109\/TIT.2010.2053901","article-title":"Efficient interpolation in the Guruswami-Sudan algorithm","volume":"56","author":"Trifonov","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"10.1016\/j.phycom.2016.06.001_br000090","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.jsc.2010.03.010","article-title":"Key equations for list decoding of Reed-Solomon codes and how to solve them","volume":"45","author":"Beelen","year":"2010","journal-title":"J. Symbolic Comput."},{"issue":"2","key":"10.1016\/j.phycom.2016.06.001_br000095","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/TCOMM.2012.100912.110752","article-title":"Progressive algebraic soft-decision decoding of Reed-Solomon codes","volume":"61","author":"Chen","year":"2013","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"10.1016\/j.phycom.2016.06.001_br000100","doi-asserted-by":"crossref","first-page":"2336","DOI":"10.1109\/TIT.2012.2235522","article-title":"On the average complexity of Reed-Solomon list decoders","volume":"59","author":"Cassuto","year":"2013","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.phycom.2016.06.001_br000105","first-page":"1","article-title":"Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes","author":"Nielsen","year":"2014","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.phycom.2016.06.001_br000110","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1515\/crll.1936.175.50","article-title":"Theorie der hoheren Differentiale in einem algebraishen Funcktionenkorper mit vollkommenem konstantenkorper nei beliebeger Charakteristic","author":"Hasse","year":"1936","journal-title":"J. Reine. Aug. Math."},{"issue":"1","key":"10.1016\/j.phycom.2016.06.001_br000115","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1109\/18.817522","article-title":"Efficient decoding of Reed-Solomon codes beyond half the minimum distance","volume":"46","author":"Roth","year":"2000","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10.1016\/j.phycom.2016.06.001_br000120","doi-asserted-by":"crossref","first-page":"2579","DOI":"10.1109\/18.945273","article-title":"Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes","volume":"47","author":"Wu","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.phycom.2016.06.001_br000125","doi-asserted-by":"crossref","unstructured":"L. Chen, R.A. Carrasco, M. Johnston, E.G. Chester, Efficient factorisation algorithm for list decoding algebraic-geometric and Reed-Solomon codes, in: Proc IEEE Int. Conf. Commun., Glasgow, UK, May 2007, pp. 851\u2013856.","DOI":"10.1109\/ICC.2007.145"},{"issue":"2","key":"10.1016\/j.phycom.2016.06.001_br000130","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1109\/18.312155","article-title":"An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder","volume":"40","author":"Kaneko","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.phycom.2016.06.001_br000135","doi-asserted-by":"crossref","unstructured":"Y. Zhu, S. Tang, A reduced-complexity algorithm for polynomial interpolation, in: Proc. IEEE Int. Symp. Inform. Theory, ISIT, Jun. 2013, pp. 316\u2013320.","DOI":"10.1109\/ISIT.2013.6620239"}],"container-title":["Physical Communication"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1874490716300404?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1874490716300404?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T16:06:32Z","timestamp":1656691592000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1874490716300404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":27,"alternative-id":["S1874490716300404"],"URL":"https:\/\/doi.org\/10.1016\/j.phycom.2016.06.001","relation":{},"ISSN":["1874-4907"],"issn-type":[{"value":"1874-4907","type":"print"}],"subject":[],"published":{"date-parts":[[2016,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Algebraic soft decoding of Reed\u2013Solomon codes with improved progressive interpolation","name":"articletitle","label":"Article Title"},{"value":"Physical Communication","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.phycom.2016.06.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}
