Abstract
There is a rich interplay between coding theory and computational complexity theory that has enriched both disciplines over the years. In particular, list decoding and closely related notions have been instrumental in several advances in explicit constructions of combinatorial objects with strong “random-like” properties, such as expander graphs, randomness extractors, and pseudorandom generators. Our aim here is to present
-
a unified list-decoding-centric view of the definition of these objects, and
-
the details of recent work due to the author, C. Umans, and S. Vadhan [3], where this viewpoint yields powerful results, namely the construction of unbalanced bipartite graphs with very strong expansion properties based on the list-decodable codes due to Parvaresh and Vardy [4]. In turn these expanders yield simple constructions of randomness extractors that are optimal up to constant factors.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Guruswami, V.: Better Extractors for Better Codes? In: 36th Annual ACM Symposium on Theory of Computing, pp. 436–444 (2004)
Guruswami, V., Rudra, A.: Explicit Capacity-Achieving List-Decodable Codes. In: 38th Annual ACM Symposium on Theory of Computing, pp. 1–10 (2006)
Guruswami, V., Umans, C., Vadhan, S.: Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. In: 22nd IEEE Conference on Computational Complexity, pp. 96–108 (2007)
Parvaresh, F., Vardy, A.: Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time. In: 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 285–294 (2005)
Shaltiel, R., Umans, C.: Simple Extractors for All Min-Entropies and a New Pseudorandom Generator. J. ACM 52(2), 172–216 (2005)
Ta-Shma, A., Zuckerman, D.: Extractor Codes. IEEE Trans. Inform. Theory 50(12), 3015–3025 (2004)
Ta-Shma, A., Zuckerman, D., Safra, S.: Extractors from Reed-Muller codes. In: 42nd Annual Symposium on Foundations of Computer Science, pp. 638–647 (2001)
Trevisan, L.: Extractors and Pseudorandom Generators. J. ACM 48(4), 860–879 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guruswami, V. (2007). List Decoding and Pseudorandom Constructions. In: Boztaş, S., Lu, HF.(. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2007. Lecture Notes in Computer Science, vol 4851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77224-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-77224-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77223-1
Online ISBN: 978-3-540-77224-8
eBook Packages: Computer ScienceComputer Science (R0)