Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PARVARESH-VARDY CODES:
Reports tagged with Parvaresh-Vardy codes:
TR06-134 | 18th October 2006
Venkatesan Guruswami, Chris Umans, Salil Vadhan

Extractors and condensers from univariate polynomials

Revisions: 1

We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractors, this matches the parameters of the current best known construction [LRVW03]; for lossless condensers, the previous best constructions achieved optimality to within ... more >>>


TR26-214 | 26th September 2026
Gil Cohen, Dean Doron, Noam Goldgraber

Algebraic-Geometric Parvaresh--Vardy Subspace Designs and Rank Condensers

A subspace design is a collection of subspaces $H_1,\ldots,H_n$ of $\mathbb{F}_q^k$ with the property that no low-dimensional subspace $W$ intersects the collection ``too much’’. Subspace designs and related objects in linear-algebraic pseudorandomness have found a broad range of applications, ranging from list decoding and recovery, to derandomizing algorithms.

We ... more >>>




ISSN 1433-8092 | Imprint