Trifferent codes with small lengths
Abstract
A code C ⊂eq \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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.