All reports by Author Inbar Ben Yaacov:

__
TR24-102
| 29th May 2024
__

Inbar Ben Yaacov, Yotam Dikstein, Gal Maor#### Sparse High Dimensional Expanders via Local Lifts

Revisions: 1

__
TR21-154
| 10th November 2021
__

Inbar Ben Yaacov, Gil Cohen, Tal Yankovitz#### Explicit Binary Tree Codes with Sub-Logarithmic Size Alphabet

__
TR20-141
| 11th September 2020
__

Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan#### Candidate Tree Codes via Pascal Determinant Cubes

Inbar Ben Yaacov, Yotam Dikstein, Gal Maor

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 applications. Like expander graphs, HDXs are especially interesting for applications when they are bounded degree, namely, if the number of edges adjacent to every vertex ... more >>>

Inbar Ben Yaacov, Gil Cohen, Tal Yankovitz

Since they were first introduced by Schulman (STOC 1993), the construction of tree codes remained an elusive open problem. The state-of-the-art construction by Cohen, Haeupler and Schulman (STOC 2018) has constant distance and $(\log n)^{e}$ colors for some constant $e > 1$ that depends on the distance, where $n$ is ... more >>>

Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan

Tree codes are combinatorial structures introduced by Schulman (STOC 1993) as key ingredients in interactive coding schemes. Asymptotically-good tree codes are long known to exist, yet their explicit construction remains a notoriously hard open problem. Even proposing a plausible construction, without the burden of proof, is difficult and the defining ... more >>>