STOC
2012
ACM
12 years 2 months ago
2012
ACM
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
CORR
2011
Springer
13 years 6 months ago
2011
Springer
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
IPL
2002
13 years 11 months ago
2002
We deal with the problem of storing a set of K elements that are taken from a large universe of size N, such that membership in the set can be determined with high probability by ...
AAECC
2002
Springer
13 years 11 months ago
2002
Springer
Abstract. For any integral convex polytope in R2 there is an explicit construction of an error-correcting code of length (q - 1)2 over the finite field Fq, obtained by evaluation o...
JGT
2006
13 years 11 months ago
2006
Given a configuration of pebbles on the vertices of a graph G, a pebbling move consists of taking two pebbles off some vertex v and putting one of them back on a vertex adjacent t...
CORR
2006
Springer
13 years 12 months ago
2006
Springer
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc...
SODA
2003
ACM
14 years 1 months ago
2003
ACM
d Abstract) N. Alon ∗ M. Capalbo † July 28, 2002 Using a new recursive technique, we present an explicit construction of an infinite family of N-superconcentrators of density...
APPROX
2008
Springer
14 years 1 months ago
2008
Springer
We give an explicit construction of a function that is almost a 2-source extractor for linear entropy, it is a condenser where the output has almost full entropy. Given 2 sources w...