Extractors for sum of two sources
From MaRDI portal
Abstract: We consider the problem of extracting randomness from extit{sumset sources}, a general class of weak sources introduced by Chattopadhyay and Li (STOC, 2016). An -sumset source is a distribution on of the form , where 's are independent sources on bits with min-entropy at least . Prior extractors either required the number of sources to be a large constant or the min-entropy to be at least . As our main result, we construct an explicit extractor for sumset sources in the setting of for min-entropy and polynomially small error. We can further improve the min-entropy requirement to at the expense of worse error parameter of our extractor. We find applications of our sumset extractor for extracting randomness from other well-studied models of weak sources such as affine sources, small-space sources, and interleaved sources. Interestingly, it is unknown if a random function is an extractor for sumset sources. We use techniques from additive combinatorics to show that it is a disperser, and further prove that an affine extractor works for an interesting subclass of sumset sources which informally corresponds to the "low doubling" case (i.e., the support of is not much larger than ).
Recommendations
- Extractors for sumset sources
- Deterministic extractors for additive sources (extended abstract)
- Extractors for Three Uneven-Length Sources
- Extractors for circuit sources
- Extractors for small zero-fixing sources
- scientific article; zbMATH DE number 7250143
- scientific article; zbMATH DE number 6789272
- Extractors and rank extractors for polynomial sources
- Extractors for Turing-machine sources
- Explicit two-source extractors and resilient functions
Cited in
(4)
This page was built for publication: Extractors for sum of two sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083614)