The maximum cardinality of trifferent codes with lengths 5 and 6
Stefano Della Fiore, Alessandro Gnutti, Sven C. Polak · Examples and Counterexamples · 2022
A code C⊆{0,1,2}n is said to be trifferent with length n when for any three distinct elements of C there exists a coordinate in which they all differ. Defining T(n) as the maximum cardinality of trifferent codes with length n, T(n) is unknown for n≥5. In this note, we use an optimized search algorithm to show that T(5)=10 and T(6)=13.