Skip to main navigation Skip to search Skip to main content

Better condensers and new extractors from parvaresh-vardy codes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We give a new construction of condensers based on Parvaresh-Vardy codes [PV]. Our condensers have entropy rate (1 - \alpha) for sub constant \alpha (in contrast to [GUV] which required constant \alpha) and suffer only sub linear entropy loss. Known extractors can be applied to the output to extract all but a sub constant fraction of the minentropy. The resulting (k, \eps) extractor E:{0, 1} n \times {0, 1} d \right arrow {0, 1} m has output length m = (1 - \alpha)k with \alpha = 1/\poly\log(n), and seed length d = O(\log n), when \eps \ge 1/2{\log \beta n} for any constant \beta.

Original languageEnglish
Title of host publicationProceedings - 2012 IEEE 27th Conference on Computational Complexity, CCC 2012
Pages309-315
Number of pages7
DOIs
StatePublished - 2012
EventIEEE Computer Society Technical Committee on Mathematical Foundations of Computing - Porto, Portugal
Duration: 26 Jun 201229 Jun 2012

Publication series

NameProceedings of the Annual IEEE Conference on Computational Complexity

Conference

ConferenceIEEE Computer Society Technical Committee on Mathematical Foundations of Computing
Country/TerritoryPortugal
CityPorto
Period26/06/1229/06/12

Keywords

  • Parvaresh-Vardy codes
  • condensers
  • randomness extractors

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'Better condensers and new extractors from parvaresh-vardy codes'. Together they form a unique fingerprint.

Cite this