{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:22:27Z","timestamp":1775053347924,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540404934","type":"print"},{"value":"9783540450610","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45061-0_9","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:54:04Z","timestamp":1184601244000},"page":"97-108","source":"Crossref","is-referenced-by-count":49,"title":["Decoding of Interleaved Reed Solomon Codes over Noisy Data"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Bleichenbacher","sequence":"first","affiliation":[]},{"given":"Aggelos","family":"Kiayias","sequence":"additional","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/18.490539","volume":"IT-42","author":"E. R. Berlekamp","year":"1996","unstructured":"Elwyn R. Berlekamp, Bounded distance+1 soft-decision Reed-Solomon decoding, IEEE Trans. Info. Theory, vol. IT-42, pp. 704\u2013720, May 1996.","journal-title":"IEEE Trans. Info. Theory"},{"key":"9_CR2","unstructured":"Elwyn R. Berlekamp and L. Welch, Error Correction of Algebraic Block Codes. U.S. Patent, Number 4,633,470, 1986."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Don Coppersmith and Madhu Sudan, Reconstructing Curves in Three (and higher)Dimensional Space from Noisy Data, to appear in the proceedings of the 35th ACM Symposium on Theory of Computing (STOC), June 9\u201311, 2003, San Diego, California.","DOI":"10.1145\/780559.780563"},{"key":"9_CR4","volume-title":"Concatenated Codes","author":"G. D. Forney","year":"1966","unstructured":"G. David Forney, Concatenated Codes, MIT Press, Cambridge, MA, 1966"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Venkatesan Guruswami and Madhu Sudan, Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes. In the Proceedings of the 39th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, pp. 28\u201339, 1998.","DOI":"10.1109\/SFCS.1998.743426"},{"key":"9_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1007\/3-540-48224-5_76","volume-title":"the Proceedings of the 28th International Colloquium in Algorithms, Languages and Programming (ICALP)","author":"A. Kiayias","year":"2001","unstructured":"Aggelos Kiayias and Moti Yung, Secure Games with Polynomial Expressions, In the Proceedings of the 28th International Colloquium in Algorithms, Languages and Programming (ICALP), 2001, LNCS Vol. 2076, pp. 939\u2013950."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Hugo Krawczyk, Distributed Fingerprints and Secure Information Dispersal, PODC 1992, pp. 207\u2013218.","DOI":"10.1145\/164051.164075"},{"key":"9_CR8","volume-title":"The Theory of Error Correcting Codes","author":"F. J. MacWilliams","year":"1977","unstructured":"F. J. MacWilliams and N. Sloane, The Theory of Error Correcting Codes. North Holland, Amsterdam, 1977."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.","DOI":"10.1201\/9781439821916"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Michael O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, J. ACM 38, pp. 335\u2013348, 1989.","DOI":"10.1145\/62044.62050"},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J. T. Schwartz","year":"1980","unstructured":"J. T. Schwartz, Fast Probabilistic Algorithms for Verifications of Polynomial Identities, Journal of the ACM, Vol. 27(4), pp. 701\u2013717, 1980.","journal-title":"Journal of the ACM"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M. Sudan","year":"1997","unstructured":"Madhu Sudan, Decoding of Reed Solomon Codes beyond the Error-Correction Bound. Journal of Complexity 13(1), pp. 180\u2013193, 1997.","journal-title":"Journal of Complexity"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"S. A. Vanstone and P. C. VanOorshot, An Introduction to Error Correcting Codes with Applications, Kluwer Academic Publishers, 1989.","DOI":"10.1007\/978-1-4757-2032-7"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45061-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:43:37Z","timestamp":1737287017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45061-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404934","9783540450610"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45061-0_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}