DocumentCode
2653616
Title
Better Condensers and New Extractors from Parvaresh-Vardy Codes
Author
Ta-Shma, Amnon ; Umans, Christopher
Author_Institution
Comput. Sci., Tel-Aviv Univ., Tel-Aviv, Israel
fYear
2012
fDate
26-29 June 2012
Firstpage
309
Lastpage
315
Abstract
We give a new construction of condensers based on Parvaresh-Vardy codes [1]. Our condensers have entropy rate (1-α) for subconstant α (in contrast to [2] which required constant α) and suffer only sublinear entropy loss. Known extractors can be applied to the output to extract all but a subconstant fraction of the minentropy. The resulting (k, ε) extractor E : {0, 1}n × {0, 1}d → {0, 1}m has output length m = (1- α)k with α = 1/poly log(n), and seed length d = O(log n), when ε ≥ 1/2logβ n for any constant ß <; 1. Thus we achieve the same “world-record” extractor parameters as [3], with a more direct construction.
Keywords
computational complexity; entropy; error correction codes; functions; Parvaresh-Vardy codes; condensers; entropy rate; extractor parameters; minentropy; seed length; subconstant fraction; sublinear entropy loss; Corporate acquisitions; Entropy; Frequency modulation; Interpolation; Linear systems; Polynomials; Radio frequency; Parvaresh-Vardy codes; condensers; randomness extractors;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity (CCC), 2012 IEEE 27th Annual Conference on
Conference_Location
Porto
ISSN
1093-0159
Print_ISBN
978-1-4673-1663-7
Type
conf
DOI
10.1109/CCC.2012.25
Filename
6243407
Link To Document