2 citations · 3 across the 22 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.IT2021
On the trifference problem for linear codes
Cosmin Pohoata, Dmitriy Zakharov
We prove that perfect -hash linear codes in must have dimension at most for some absolute constant .
math.PR2021
The multinomial tiling model
Richard Kenyon, Cosmin Pohoata
Given a graph and collection of subgraphs (called tiles), we consider covering with copies of tiles in so that each vertex is covered with a predetermined…
math.CO2021
Norm hypergraphs
Cosmin Pohoata, Dmitriy Zakharov
We introduce a high uniformity generalization of the so-called (projective) norm graphs of Alon, Kollár, Rónyai, and Szabó, and use it to show that $$\operatorname{ex}_{d}(n,K_{s_{…