Extractors from Reed-Muller codes

A. Ta-Shma, D. Zuckerman, S. Safra

Research output: Contribution to journalConference articlepeer-review

Abstract

Finding explicit extractors is an important derandomization goal that has received a lot of attention in the past decade. Previous research has focused on two approaches, one related to hashing and the other to pseudorandom generators. A third view, regarding extractors as good error correcting codes, was noticed before. Yet, researchers had failed to build extractors directly from a good code without using other tools from pseudorandomness. We succeed in constructing an extractor directly from a Reed-Muller code. To do this, we develop a novel proof technique. Furthermore, our construction is the first to achieve degree close to linear. In contrast, the best previous constructions brought the log of the degree within a constant of optimal, which gives polynomial degree. This improvement is important for certain applications. For example, it follows that approximating the VC dimension to within a factor of N1-δ is AM-hard for any positive δ.

Original languageEnglish
Pages (from-to)638-647
Number of pages10
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
DOIs
StatePublished - 2001
Event42nd Annual Symposium on Foundations of Computer Science - Las Vegas, NV, United States
Duration: 14 Oct 200117 Oct 2001

Fingerprint

Dive into the research topics of 'Extractors from Reed-Muller codes'. Together they form a unique fingerprint.

Cite this