More than twenty years ago, Capalbo, Rein-gold, Vadhan and Wigderson gave the first (and
up to date only) explicit construction of a bipartite expander with almost full combinatorial …

Abstract Recently, Kumar and Mon reached a significant milestone by constructing
asymptotically good relaxed locally correctable codes (RLCCs) with poly-logarithmic query …

We construct an infinite family of bounded-degree bipartite unique neighbour expander
graphs with arbitrarily unbalanced sides. Although weaker than the lossless expanders …

In this note, we give very simple constructions of unique neighbor expander graphs starting
from spectral or combinatorial expander graphs of mild expansion. These constructions and …

We present the first explicit construction of two-sided lossless expanders in the unbalanced
setting (bipartite graphs that have many more nodes on the left than on the right). Prior to our …

Abstract A (d 1 d 2)-biregular bipartite graph G=(L∪ R, E) is called left-(m, δ) unique-
neighbor expander iff each subset S of the left vertices with| S|≤ m has at least δd 1| S …

We construct the first explicit two-sided vertex expanders that bypass the spectral barrier.
Previously, the strongest known explicit vertex expanders were given by $ d $-regular …

Property testing has been a major area of research in computer science in the last three
decades. By property testing we refer to an ensemble of problems, results and algorithms …

Tanner codes are graph-based linear codes whose parity-check matrices can be
characterized by a bipartite graph $ G $ together with a linear inner code $ C_0 $. Expander …