The maximum cardinality of trifferent codes with lengths 5 and 6
Stefano Della Fiore, Alessandro Gnutti, Sven Polak
Examples and Counterexamples · 2022
doi:10.1016/j.exco.2022.100051 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY-NC
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.