Increasing the Output Length of Zero-Error Dispersers

DOI10.1007/978-3-540-85363-3_34zbMath1159.68640OpenAlexW2161285947MaRDI QIDQ3541810

Ronen Shaltiel, Ariel Gabizon

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_34

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Generalized Ramsey theory (05C55) Data structures (68P05) Randomized algorithms (68W20)

Related Items (3)

An Introduction to Randomness Extractors ⋮ Improving the Hadamard extractor ⋮ Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Extractors and rank extractors for polynomial sources
• 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
• Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
• On the complexity of approximating the VC dimension.
• Randomness is linear in space
• 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
• A Sample of Samplers: A Computational Perspective on Sampling
• Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
• How to get more mileage from randomness extractors
• Extractors
• Extractors with weak random seeds
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• Should Tables Be Sorted?
• Implicit $O(1)$ Probe Search
• Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
• 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
• 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

This page was built for publication: Increasing the Output Length of Zero-Error Dispersers