The maximum cardinality of trifferent codes with lengths 5 and 6

Abstract

A code C⊆{0,1,2}nis 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)=10and T(6)=13.

Keywords

• Perfect k-hashing
• Trifferent codes