Trifferent codes with small lengths

Sascha Kurz Β· Examples and Counterexamples Β· 2024

A code 𝐢 βŠ† {0, 1, 2} 𝑛 of length 𝑛 is called trifferent if for any three distinct elements of 𝐢 there exists a coordinate in which they all differ.By 𝑇 (𝑛) we denote the maximum cardinality of trifferent codes with length 𝑛.The values 𝑇 (5) = 10 and 𝑇 (6) = 13 were recently determined (Fiore et al., 2022).Here we determine 𝑇 (7) = 16, 𝑇 (8) = 20, and 𝑇 (9) = 27.For the latter case 𝑛 = 9 there also exist linear codes attaining the maximum possible cardinality 27.

Read the paper Β· More papers on PaperTik