On the trifference problem for linear codes

Abstract

We prove that perfect $3$-hash linear codes in $\mathbb{F}_{3}^{n}$ must have dimension at most $ \left(\frac{1}{4}-\epsilon\right)n$ for some absolute constant $\epsilon > 0$.