{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:30Z","timestamp":1772283690715,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540725039","type":"print"},{"value":"9783540725046","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_27","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T07:36:39Z","timestamp":1185089799000},"page":"296-305","source":"Crossref","is-referenced-by-count":20,"title":["On Deciding Deep Holes of Reed-Solomon Codes"],"prefix":"10.1007","author":[{"given":"Qi","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Elizabeth","family":"Murray","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Berlekamp, E., Welch, L.: Error correction of algebraic block codes. U.S. Patent Number 4633470 (1986)"},{"key":"27_CR2","unstructured":"Cafure, A., Matera, G.: Improved explicit estimates on the number of solutions of equations over a finite field (2004), \n                    \n                      http:\/\/www.arxiv.org\/abs\/math.NT\/0405302"},{"key":"27_CR3","unstructured":"Cheng, Q., Wan, D.: On the list and bounded distance decodibility of the Reed-Solomon codes (extended abstract). In: Proc. 45th IEEE Symp. on Foundations of Comp. Science, FOCS, pp. 335\u2013341 (2004)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, S.D.: Explicit theorems on generator polynomials. Finite Fields and Their Applications. To appear (2005)","DOI":"10.1016\/j.ffa.2005.05.002"},{"key":"27_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"issue":"6","key":"27_CR6","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Transactions on Information Theory\u00a045(6), 1757\u20131767 (1999)","journal-title":"IEEE Transactions on Information Theory"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Vardy, A.: Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. In: Proceeding of SODA (2005)","DOI":"10.1109\/TIT.2005.850102"},{"key":"27_CR8","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0080437","volume-title":"Equations over Finite Fields. An Elementary Approach","author":"W. Schmidt","year":"1976","unstructured":"Schmidt, W.: Equations over Finite Fields. An Elementary Approach. Lecture Notes in Mathematics, vol.\u00a0536. Springer, Heidelberg (1976)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:38:09Z","timestamp":1619501889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_27","relation":{},"subject":[]}}