On the trifference problem for linear codes

04/30/2021

∙

by   Cosmin Pohoata, et al.

∙

0

∙

share

We prove that perfect 3-hash linear codes in 𝔽_3^n must have dimension at most (1/4-ϵ)n for some absolute constant ϵ > 0.