{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:43Z","timestamp":1772283703400,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642299513","type":"print"},{"value":"9783642299520","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_24","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"214-224","source":"Crossref","is-referenced-by-count":7,"title":["Computing Error Distance of Reed-Solomon Codes"],"prefix":"10.1007","author":[{"given":"Guizhen","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Daqing","family":"Wan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Berlekamp, E., Welch, L.: Error correction of algebraic block codes. U.S. Patent Number 4633470 (1986)"},{"key":"24_CR2","unstructured":"Cafure, A., Matera, G., Privitelli, M.: Singularities of symmetric hypersurfaces and an application to Reed-Solomon codes. arXiv 1109.2265v1 (September 10, 2011)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-72504-6_27","volume-title":"Theory and Applications of Models of Computation","author":"Q. Cheng","year":"2007","unstructured":"Cheng, Q., Murray, E.: On Deciding Deep Holes of Reed-Solomon Codes. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol.\u00a04484, pp. 296\u2013305. Springer, Heidelberg (2007)"},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/S0097539705447335","volume":"37","author":"Q. Cheng","year":"2007","unstructured":"Cheng, Q., Wan, D.: On the list and bounded distance decodability of Reed-Solomon codes. SIAM J. Comput.\u00a037(1), 195\u2013209 (2007)","journal-title":"SIAM J. Comput."},{"issue":"10","key":"24_CR5","doi-asserted-by":"publisher","first-page":"5217","DOI":"10.1109\/TIT.2010.2060234","volume":"56","author":"Q. Cheng","year":"2010","unstructured":"Cheng, Q., Wan, D.: Complexity of decoding positive-rate Reed-Solomon codes. IEEE Trans. Inform. Theory\u00a056(10), 5217\u20135222 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1995","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Trans. Inform. Theory\u00a045(6), 1757\u20131767 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"24_CR7","doi-asserted-by":"publisher","first-page":"2249","DOI":"10.1109\/TIT.2005.850102","volume":"51","author":"V. Guruswami","year":"2005","unstructured":"Guruswami, V., Vardy, A.: A Maximum-likelihood decoding of Reed-Solomon codes is NP-Hard. IEEE Trans. Inform. Theory\u00a051(7), 2249\u20132256 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1016\/j.ffa.2008.05.003","volume":"14","author":"J.Y. Li","year":"2008","unstructured":"Li, J.Y., Wan, D.: On the subset sum problem over finite fields. Finite Fields Appl.\u00a014, 911\u2013929 (2008)","journal-title":"Finite Fields Appl."},{"issue":"9","key":"24_CR9","doi-asserted-by":"publisher","first-page":"2351","DOI":"10.1007\/s11425-010-3121-9","volume":"53","author":"J.Y. Li","year":"2010","unstructured":"Li, J.Y., Wan, D.: A new sieve for distinct coordinate counting. Science China Mathematics\u00a053(9), 2351\u20132362 (2010)","journal-title":"Science China Mathematics"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Li, J.Y., Wan, D.: Counting subset sums of finite abelian groups. Journal of Combinatorial Theory Series A\u00a0119(1) (January 2012)","DOI":"10.1016\/j.jcta.2011.07.003"},{"issue":"11","key":"24_CR11","doi-asserted-by":"publisher","first-page":"1982","DOI":"10.1007\/s11425-008-0066-3","volume":"51","author":"J.Y. Li","year":"2008","unstructured":"Li, J.Y., Wan, D.: On error distance of Reed-Solomon codes. Science in China Mathematics\u00a051(11), 1982\u20131988 (2008)","journal-title":"Science in China Mathematics"},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s11401-010-0622-3","volume":"32B","author":"Q. Liao","year":"2011","unstructured":"Liao, Q.: On Reed-Solomon Codes. Chinese Annals of Mathematics Series B\u00a032B(1), 89\u201398 (2011)","journal-title":"Chinese Annals of Mathematics Series B"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M. Sudan","year":"2007","unstructured":"Sudan, M.: Decoding of Reed-Solomon codes beyond the error-correction bound. J. Complexity\u00a013, 180\u2013193 (2007)","journal-title":"J. Complexity"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1090\/S0025-5718-97-00835-1","volume":"66","author":"D. Wan","year":"1997","unstructured":"Wan, D.: Generators and irreducible polynomials over finite fields. Mathematics of Computation\u00a066, 119\u20131212 (1997)","journal-title":"Mathematics of Computation"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Zhu, G., Wan, D.: An asymptotic formula for counting subset sums over subgroups of finite fields. Finite Fields Appl. (2011), doi:10.1016\/j.ffa.2011.07.010","DOI":"10.1016\/j.ffa.2011.07.010"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T00:55:40Z","timestamp":1676768140000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}