Error-Correcting Codes and Pseudorandom Projections

Authors:
Luca Trevisan
Affiliations:
-
Venue:
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Year:
2001

Citing 10
Cited 1

Hardness vs randomness

Journal of Computer and System Sciences
Construction of extractors using pseudo-random generators (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extracting all the randomness and reducing the error in Trevisan's extractors

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Extractors and pseudo-random generators with optimal seed length

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pseudorandom generators without the XOR lemma

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Loss-less condensers, unbalanced expanders, and extractors

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Derandomizing Arthur-Merlin Games Using Hitting Sets

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Extractors from Reed-Muller Codes

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science

Approximation of the Quadratic Set Covering problem

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this talk we discuss constructions of hash functions, randomness extractors, pseudorandom generators and hitting set generators that are based on the same principle: encode the "input" using an error-correcting code, select a random (or pseudorandom) subset of the bits of the encoding, and output the encoded codeword restricted to such bits. This general approach is common to constructions of very different combinatorial objects, and somewhat different strategies are used to analyse such different constructions.