Abstract
Optimal dispersers have better dependence on the error than optimal extractors. In this paper we give explicit disperser constructions that beat the best possible extractors in some parameters. Our constructions are not strong, but we show that having such explicit strong constructions implies a solution to the Ramsey graph construction problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.: Construction of asymptotically good, lowrate error-correcting codes through pseudo-random graphs. Transactions on Information Theory 38, 509–516 (1992)
Barak, B., Kindler, G., Shaltiel, R., Sudakov, B., Wigderson, A.: Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors. In: 37th STOC (2005)
Cohen, A., Wigderson, A.: Dispersers, deterministic amplification, and weak random sources. In: Proc. of 30th FOCS, pp. 14–19 (1989)
Goldreich, O., Wigderson, A.: Tiny families of functions with random properties: a quality-size trade-off for hashing. Random Structures and Algorithms 11, 4 (1997)
Kahale, N.: Better expansion for Ramanujan graphs. In: 33rd FOCS, pp. 398–404 (1992)
Lubotzky, A., Phillips, R., Sarnak, P.: Explicit expanders and the Ramanujan conjectures. In: 18th STOC, pp. 240–246 (1986)
Nisan, N., Ta-Shma, A.: Extracting randomness: A survey and new constructions. Journal of Computer and System Sciences 58(1), 148–173 (1999)
Nisan, N., Zuckerman, D.: More deterministic simulation in logspace. In: 25th STOC, pp. 235–244 (1993)
Raz, R.: Extractors with weak random seeds. In: 37th STOC (2005)
Radhakrishnan, J., Ta-Shma, A.: Tight bounds for depth-two superconcentrators. In: 38th FOCS, Miami Beach, Florida, October 20-22, pp. 585–594. IEEE, Los Alamitos (1997)
Raz, R., Reingold, O., Vadhan, S.: Error reduction for extractors. In: 40th FOCS. IEEE, Los Alamitos (1999)
Reingold, O., Vadhan, S., Wigderson, A.: Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In: Proc. 41st FOCS, pp. 3–13 (2000)
Sipser, M.: Expanders, randomness, or time versus space. Journal of Computer and System Sciences 36(3), 379–383 (1988)
Srinivasan, A., Zuckerman, D.: Computing with very weak random sources. In: 35th FOCS, pp. 264–275 (1994)
Ta-Shma, A.: Almost optimal dispersers. In: 30th STOC, Dallas, TX, May 1998, pp. 196–202. ACM Press, New York (1998)
Ta-Shma, A., Umans, C., Zuckerman, D.: Loss-less condensers, unbalanced expanders, and extractors. In: Proc. 33rd STOC, pp. 143–152 (2001)
Ta-Shma, A., Zuckerman, D.: Personal communication
Zuckerman, D.: General weak random sources. In: 31st FOCS (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gradwohl, R., Kindler, G., Reingold, O., Ta-Shma, A. (2005). On the Error Parameter of Dispersers. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds) Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2005 2005. Lecture Notes in Computer Science, vol 3624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538462_25
Download citation
DOI: https://doi.org/10.1007/11538462_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28239-6
Online ISBN: 978-3-540-31874-3
eBook Packages: Computer ScienceComputer Science (R0)