{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:51:43Z","timestamp":1772808703440,"version":"3.50.1"},"reference-count":16,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2016]]},"DOI":"10.3934\/amc.2016015","type":"journal-article","created":{"date-parts":[[2016,5,2]],"date-time":"2016-05-02T17:06:13Z","timestamp":1462208773000},"page":"413-427","source":"Crossref","is-referenced-by-count":9,"title":["On the error distance of extended Reed-Solomon codes"],"prefix":"10.3934","volume":"10","author":[{"given":"Yujuan","family":"Li","sequence":"first","affiliation":[]},{"given":"Guizhen","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2016015-1","unstructured":"E. Berlekamp and L. Welch, Error correction of algebraic block codes, US Patent Number 4633470, 1986."},{"key":"key-10.3934\/amc.2016015-2","doi-asserted-by":"publisher","unstructured":"A. Cafure, G. Matera and M. Privitelli, Singularities of symmetric hypersurfaces and an application to Reed-Solomon codes, <em>Adv. Math. Commun.<\/em>, <strong>6<\/strong> (2012), 69-94.","DOI":"10.3934\/amc.2012.6.69"},{"key":"key-10.3934\/amc.2016015-3","doi-asserted-by":"publisher","unstructured":"Q. Cheng, J. Li and J. Zhuang, On determining deep holes of generalized Reed-Solomon codes, in <em>Algorithms and Computation<\/em>, Springer, Berlin, 2013, 100-110.","DOI":"10.1007\/978-3-642-45030-3_10"},{"key":"key-10.3934\/amc.2016015-4","doi-asserted-by":"publisher","unstructured":"Q. Cheng and E. Murray, On deciding deep holes of Reed-Solomon codes, in <em>Proc. TAMC 2007<\/em>, Springer, 2007, 296-305.","DOI":"10.1007\/978-3-540-72504-6_27"},{"key":"key-10.3934\/amc.2016015-5","doi-asserted-by":"publisher","unstructured":"Q. Cheng and D. Wan, On the list and bounded distance decodability of Reed-Solomon codes, <em>SIAM J. Comput.<\/em>, <strong>37<\/strong> (2007), 195-209.","DOI":"10.1137\/S0097539705447335"},{"key":"key-10.3934\/amc.2016015-6","doi-asserted-by":"publisher","unstructured":"Q. Cheng and D. Wan, Complexity of decoding positive-rate Reed-Solomon codes, <em>IEEE Trans. Inf. Theory<\/em>, <strong>56<\/strong> (2010), 5217-5222.","DOI":"10.1109\/TIT.2010.2060234"},{"key":"key-10.3934\/amc.2016015-7","doi-asserted-by":"publisher","unstructured":"V. Guruswami and M. Sudan, Improved decoding of Reed-Solomon and algebraic-geometry codes, <em>IEEE Trans. Inf. Theory<\/em>, <strong>45<\/strong> (1995), 1757-1767.","DOI":"10.1109\/18.782097"},{"key":"key-10.3934\/amc.2016015-8","doi-asserted-by":"publisher","unstructured":"V. Guruswami and A. Vardy, A Maximum-likelihood decoding of Reed-Solomon codes is NP-Hard, <em>IEEE Trans. Inf. Theory<\/em>, <strong>51<\/strong> (2005), 2249-2256.","DOI":"10.1109\/TIT.2005.850102"},{"key":"key-10.3934\/amc.2016015-9","doi-asserted-by":"publisher","unstructured":"Y. J. Li and D. Wan, On error distance of Reed-Solomon codes, <em>Sci. China Math.<\/em>, <strong>51<\/strong> (2008), 1982-1988.","DOI":"10.1007\/s11425-008-0066-3"},{"key":"key-10.3934\/amc.2016015-10","doi-asserted-by":"publisher","unstructured":"J. Y. Li and D. Wan, On the subset sum problem over finite fields, <em>Finite Fields Appl.<\/em>, <strong>14<\/strong> (2008), 911-929.","DOI":"10.1016\/j.ffa.2008.05.003"},{"key":"key-10.3934\/amc.2016015-11","doi-asserted-by":"publisher","unstructured":"Q. Liao, On Reed-Solomon Codes, <em>Chinese Ann. Math. Ser. B<\/em>, <strong>32<\/strong> (2011), 89-98.","DOI":"10.1007\/s11401-010-0622-3"},{"key":"key-10.3934\/amc.2016015-12","doi-asserted-by":"crossref","unstructured":"R. Lidl and H. Niederreiter, <em>Finite Fields<\/em>, 2nd edtion, Cambridge Univ. Press. 1997.","DOI":"10.1017\/CBO9780511525926"},{"key":"key-10.3934\/amc.2016015-13","doi-asserted-by":"publisher","unstructured":"M. Sudan, Decoding of Reed-Solomon codes beyond the error-correction bound , <em>J. Complexity<\/em>, <strong>13<\/strong> (2007), 180-193.","DOI":"10.1006\/jcom.1997.0439"},{"key":"key-10.3934\/amc.2016015-14","unstructured":"preprint, <a href=\"http:\/\/arxiv.org\/abs\/1205.7016\" target=\"_blank\">arXiv:1205.7016<\/a>"},{"key":"key-10.3934\/amc.2016015-15","doi-asserted-by":"crossref","unstructured":"J. Zhang, F. W. Fu and Q. Y. Liao, Deep holes of generalized Reed-Solomon codes (in Chinese), <em>Sci. Sin. Math.<\/em>, <strong>43<\/strong> (2013), 727-740.","DOI":"10.1360\/012012-30"},{"key":"key-10.3934\/amc.2016015-16","doi-asserted-by":"publisher","unstructured":"G. Zhu and D. Wan, Computing error distance of Reed-Solomon codes, in <em>Theory and Applications of Models of Computation<\/em>, Springer, Berlin, 2012, 214-224.","DOI":"10.1007\/978-3-642-29952-0_24"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.aimsciences.org\/journals\/displayArticlesnew.jsp?paperID=12529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:06:09Z","timestamp":1772791569000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2016015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2016015","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}