Extractors and Lower Bounds for Locally Samplable Sources
From MaRDI portal
Publication:5894225
DOI10.1007/978-3-642-22935-0_41zbMath1343.94028MaRDI QIDQ5894225
No author found.
Publication date: 17 August 2011
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22935-0_41
94A20: Sampling theory in information and communication theory
Related Items
Sampling Lower Bounds: Boolean Average-Case and Permutations, How to extract useful randomness from unreliable sources
Cites Work
- Extractors and rank extractors for polynomial sources
- Affine extractors over prime fields
- On the construction of affine extractors
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- Randomness is linear in space
- Deterministic extractors for affine sources over large fields
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Extractors with weak random seeds
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
- Extractors for Circuit Sources
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Extracting Randomness Using Few Independent Sources
- Deterministic extractors for small-space sources
- Simulating independence
