The maximum cardinality of trifferent codes with lengths 5 and 6
A code C⊆{0,1,2}n is 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 algorit...
Gespeichert in:
| Veröffentlicht in: | Examples and counterexamples 2022-11, Vol.2, p.100051, Article 100051 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | A code C⊆{0,1,2}n is 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)=10 and T(6)=13. |
|---|---|
| ISSN: | 2666-657X 2666-657X |
| DOI: | 10.1016/j.exco.2022.100051 |