activity
20042021
most citedAn additive combinatorics approach to the log-rank conjecture in communication complexity

6 citations · 14 across the 5 of their papers we have counts for

collaborators
Showing 2014Show all

1 paper · 1 filter

cs.IT2014★ 4 cited

Subspace Polynomials and Cyclic Subspace Codes

Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon +1

Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possib…