On the Trifference Problem for Linear Codes

We prove that for
$n$
sufficiently large, all 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$
.