On the trifference problem for linear codes
Information Theory
2021-05-21 v2 Combinatorics
math.IT
Abstract
We prove that perfect -hash linear codes in must have dimension at most for some absolute constant .
Cite
@article{arxiv.2105.00122,
title = {On the trifference problem for linear codes},
author = {Cosmin Pohoata and Dmitriy Zakharov},
journal= {arXiv preprint arXiv:2105.00122},
year = {2021}
}