{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:19Z","timestamp":1725548959993},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_46","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T13:06:19Z","timestamp":1267535179000},"page":"557-568","source":"Crossref","is-referenced-by-count":0,"title":["Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes"],"prefix":"10.1007","author":[{"given":"Eran","family":"Rom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amnon","family":"Ta-Shma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","first-page":"436","volume-title":"Proceedings of the 36th Annual ACM Symposium on Theory of Computing","author":"V. Guruswami","year":"2004","unstructured":"Guruswami, V.: Better extractors for better codes? In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 436\u2013444. ACM Press, New York (2004)"},{"key":"46_CR2","unstructured":"Elias, P.: List decoding for noisy channels. In: 1957-IRE WESCON Convention Record, Pt. 2, pp. 94\u2013104 (1957)"},{"key":"46_CR3","unstructured":"Sudan, M.: Lecture Notes on Algorithmic Introduction to Coding Theory, \n                    \n                      http:\/\/theory.lcs.mit.edu\/~madhu\/FT01\/scribe\/overall.ps"},{"key":"46_CR4","first-page":"28","volume-title":"Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science","author":"V. Guruswami","year":"1998","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of reed-solomon and algebraic-geometric codes. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, p. 28. IEEE Computer Society, Los Alamitos (1998)"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Ta-Shma, A., Zuckerman, D.: Extractor codes. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 193\u2013199 (2001)","DOI":"10.1145\/380752.380800"},{"key":"46_CR6","first-page":"812","volume-title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing","author":"V. Guruswami","year":"2002","unstructured":"Guruswami, V., Indyk, P.: Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 812\u2013821. ACM Press, New York (2002)"},{"key":"46_CR7","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/18.119713","volume":"38","author":"N. Alon","year":"1992","unstructured":"Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.: Construction of asymptotically good, low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory\u00a038, 509\u2013516 (1992)","journal-title":"IEEE Transactions on Information Theory"},{"key":"46_CR8","unstructured":"Reingold, O., Vadhan, S., Wigderson, A.: Entropy waves, the zig-zag product, and new constant-degree expanders and extractors. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (2000)"},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Discrete Mathematics\u00a013, 2\u201324 (2000)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"46_CR10","series-title":"Wiley\u2013Interscience Series","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"Alon, N., Spencer, J.H., Erd\u0151s, P.: The Probabilistic Method. Wiley\u2013Interscience Series. John Wiley & Sons, Inc., New York (1992)"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Ta-Shma, A., Zuckerman, D., Safra, S.: Extractors from Reed-Muller codes. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 638\u2013647 (2001)","DOI":"10.1109\/SFCS.2001.959940"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:30:24Z","timestamp":1558272624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}