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

We present a new explicit construction of onesided bipartite lossless expanders of constant
degree, with arbitrary constant ratio between the sizes of the two vertex sets. Our …

We study the problem of constructing explicit sparse graphs that exhibit strong vertex
expansion. Our main result is the first two-sided construction of imbalanced unique-neighbor …

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 …

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 construct an infinite family of bounded-degree bipartite unique neighbour expander
graphs with arbitrarily unbalanced sides. Although weaker than the lossless expanders …

Quantum low-density parity-check (qLDPC) codes are an important component in the quest
for quantum fault tolerance. Dramatic recent progress on qLDPC codes has led to …

High dimensional expanders (HDXs) are a hypergraph generalization of expander graphs.
They are extensively studied in the math and TCS communities due to their many …

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₀. Expander codes …

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 …