The maximum cardinality of trifferent codes with lengths 5 and 6
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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2022-11-01
|
| Series: | Examples and Counterexamples |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2666657X22000039 |
| Summary: | 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. |
|---|---|
| ISSN: | 2666-657X |