The maximum cardinality of trifferent codes with lengths 5 and 6
A code πβ{0, 1, 2}^n is said to be trifferent with length n when for any three distinct elements of π there exists a coordinate in which they all differ. Defining π―(n) as the maximum cardinality of trifferent codes with length n, π―(n) is unknown for n β₯ 5. In this note, we use an optimized search algorithm to show that π―(5) = 10 and π―(6) = 13.
READ FULL TEXT