Trifferent codes with small lengths

Abstract

A code $C\subseteq \{0,1,2{\}}^n$ of length $n$ is called trifferent if for any three distinct elements of $C$ there exists a coordinate in which they all differ. By $T(n)$ we denote the maximum cardinality of trifferent codes with length. $T(5)=10$ and $T(6)=13$ were recently determined. Here we determine $T(7)=16$, $T(8)=20$, and $T(9)=27$. For the latter case $n=9$ there also exist linear codes attaining the maximum possible cardinality $27$.

11 pages, 3 tables

References in corpus (2)

• A geometric characterization of minimal codes and their asymptotic performance
• The maximum cardinality of trifferent codes with lengths 5 and 6