Improving the Hadamard extractor
From MaRDI portal
Publication:1758168
DOI10.1016/j.tcs.2012.07.030zbMath1253.68254WikidataQ62040329 ScholiaQ62040329MaRDI QIDQ1758168
Matej Pivoluska, Jan Bouda, Martin Plesch
Publication date: 8 November 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.030
81P68: Quantum computation
94A60: Cryptography
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Cites Work
- Unnamed Item
- Affine extractors over prime fields
- On the construction of affine extractors
- Generating quasi-random sequences from semi-random sources
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
- Extracting randomness: A survey and new constructions
- Deterministic extractors for affine sources over large fields
- Extractors for a constant number of polynomially small min-entropy independent sources
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
- Three XOR-Lemmas — An Exposition
- How to get more mileage from randomness extractors
- Increasing the Output Length of Zero-Error Dispersers
- Extractors with weak random seeds
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- 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
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Simulating independence
