A361837 Maximum cardinality of trifferent codes with length n.

3, 4, 6, 9, 10, 13, 16, 20, 27

Offset: 1

Author

Lorenzo Sauras Altuzarra, Mar 26 2023

Keywords

• nonn
• hard
• more

Comments

(9/5)^(n/4) <= a(n) <= 2*(3/2)^n.

Links

• Anurag Bishnoi, The Trifference Problem.
• Stefano Della Fiore, Alessandro Gnutti and Sven Polak, The maximum cardinality of trifferent codes with lengths 5 and 6, Examples and Counterexamples, 2 (2022).
• Sascha Kurz, Trifferent codes with small lengths, Examples and Counterexamples, 5 (2024).

Extensions

a(7)-a(9), from Kurz link, added by Bert Dobbelaere, May 11 2025