{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:42:49Z","timestamp":1725486169728},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430025"},{"type":"electronic","value":"9783540452942"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45294-x_17","type":"book-chapter","created":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T22:45:12Z","timestamp":1181601912000},"page":"195-206","source":"Crossref","is-referenced-by-count":0,"title":["List Decoding from Erasures: Bounds and Code Constructions"],"prefix":"10.1007","author":[{"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,26]]},"reference":[{"key":"17_CR1","unstructured":"N. Alon. Personal Communication, October 1999."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/18.119713","volume":"38","author":"N. Alon","year":"1992","unstructured":"N. Alon, J. Bruck, J. Naor, M. Naor and R. Roth. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. on Information Theory, 38 (1992), pp. 509\u2013516.","journal-title":"IEEE Trans. on Information Theory"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"N. Alon, O. Goldreich, J. H\u00e5stad and R. Peralta. Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms, 3 (1992), pp. 289\u2013304.","journal-title":"Random Structures and Algorithms"},{"issue":"1","key":"17_CR4","first-page":"11","volume":"22","author":"V. M. Blinovsky","year":"1986","unstructured":"V. M. Blinovsky. Bounds for codes in the case of list decoding of finite volume. Prob. Information Transmission, 22 (1), pp. 11\u201325 (in Russian), 1986; pp. 7\u201319 (in English), 1986.","journal-title":"Prob. Information Transmission"},{"key":"17_CR5","unstructured":"P. Elias. Coding for two noisy channels. Information Theory, Third London Symposium, September 1955, Buttersworth\u2019s Scientific Publications, pp. 61\u201376."},{"key":"17_CR6","unstructured":"P. Elias. List decoding for noisy channels. Wescon Convention Record, Part 2, Institute of Radio Engineers (now IEEE), pp. 94\u2013104, 1957."},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/18.61123","volume":"37","author":"P. Elias","year":"1991","unstructured":"P. Elias. Error-correcting codes for list decoding. IEEE Trans. Info. Theory, 37 (1), pp. 5\u201312, 1991.","journal-title":"IEEE Trans. Info. Theory"},{"key":"17_CR8","volume-title":"Concatenated Codes","author":"G. D. Forney","year":"1996","unstructured":"G. D. Forney. Concatenated Codes. MIT Press, Cambridge, MA, 1996."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"A. Gal, S. Halevi, R. J. Lipton and E. Petrank. Computing from partial solutions. Proc. of 14th Annual IEEE Conference on Computation Complexity, pp. 34\u201345, 1999.","DOI":"10.1109\/CCC.1999.766260"},{"key":"17_CR10","unstructured":"V. Guruswami. List Decoding of Error-Correcting Codes. Ph.D thesis, Massachusetts Institute of Technology, August 2001."},{"key":"17_CR11","unstructured":"V. Guruswami, J. H\u00e5stad, M. Sudan and D. Zuckerman. Combinatorial Bounds for List Decoding. Proceedings of the 38th Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, October 2000."},{"key":"17_CR12","unstructured":"V. Guruswami and P. Indyk. Untitled Manuscript, April 2001."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","unstructured":"V. Guruswami and M. Sudan. Improved Decoding of Reed-Solomon and Algebraicgeometric codes. IEEE Transactions on Information Theory, 45 (1999), pp. 1757\u20131767.","journal-title":"IEEE Transactions on Information Theory"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"V. Guruswami and M. Sudan. List decoding algorithms for certain concatenated codes. Proc. of 32nd ACM Symposium on the Theory of Computing (STOC), May 2000, pp. 181\u2013190.","DOI":"10.1145\/335305.335327"},{"key":"17_CR15","unstructured":"V. Guruswami and M. Sudan. The Johnson Bound: Revisitedand Improved. Submitted for publication, December 2000."},{"key":"17_CR16","unstructured":"R. R. Nielsen and T. H\u00f8holdt. Decoding Reed-Solomon codes beyond half the minimum distance. Proceedings of the International conference on Coding Theory and Cryptography, 1998."},{"issue":"1","key":"17_CR17","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1109\/18.817522","volume":"46","author":"R. Roth","year":"2000","unstructured":"R. Roth and G. Ruckenstein. Efficient decoding of Reed-Solomon codes beyond half the minimum distance. IEEE Transactions on Information Theory, 46(1), pp. 246\u2013257, January 2000.","journal-title":"IEEE Transactions on Information Theory"},{"key":"17_CR18","volume-title":"Graduate Texts in Mathematics","author":"J. H. Lint van","year":"1999","unstructured":"J. H. van Lint. Introduction to Coding Theory. Graduate Texts in Mathematics 86, (Third Edition) Springer-Verlag, Berlin, 1999.","edition":"Third Edition"},{"key":"17_CR19","first-page":"90","volume":"48","author":"J. M. Wozencraft","year":"1958","unstructured":"J. M. Wozencraft. List Decoding. Quarterly Progress Report, Research Laboratory of Electronics, MIT, Vol. 48 (1958), pp. 90\u201395.","journal-title":"Quarterly Progress Report"},{"issue":"4","key":"17_CR20","first-page":"29","volume":"17","author":"V. V. Zyablov","year":"1981","unstructured":"V. V. Zyablov and M. S. Pinsker. List cascade decoding. In Prob. Information Transmission, 17 (4), pp. 29\u201334 (in Russian), 1981; pp. 236\u2013240 (in English), 1982.","journal-title":"Prob. Information Transmission"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45294-X_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T04:35:17Z","timestamp":1550378117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45294-X_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430025","9783540452942"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45294-x_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}