Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > SUBSPACE EVASIVE SETS:
Reports tagged with subspace evasive sets:
TR12-095 | 23rd July 2012
Avraham Ben-Aroya, Igor Shinkar

#### A Note on Subspace Evasive Sets

A subspace-evasive set over a field ${\mathbb F}$ is a subset of ${\mathbb F}^n$ that has small intersection with any low-dimensional affine subspace of ${\mathbb F}^n$. Interest in subspace evasive sets began in the work of Pudlák and Rödl (Quaderni di Matematica 2004). More recently, Guruswami (CCC 2011) showed that ... more >>>

TR20-172 | 13th November 2020
Venkatesan Guruswami, Chaoping Xing

#### Optimal rate list decoding over bounded alphabets using algebraic-geometric codes

We construct two classes of algebraic code families which are efficiently list decodable with small output list size from a fraction $1-R-\epsilon$ of adversarial errors where $R$ is the rate of the code, for any desired positive constant $\epsilon$. The alphabet size depends only on $\epsilon$ and is nearly-optimal.

The ... more >>>

ISSN 1433-8092 | Imprint