We revisit the construction of high noise, almost optimal rate list decodable code of Guruswami [1]. Guruswami showed that if one can explicitly construct optimal extractors then o...
An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...
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 so...
Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon ...
We examine 2-dimensional 3-dispersion lattice interleavers in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight...