Emergent Mind
The maximum cardinality of trifferent codes with lengths 5 and 6
(2201.06846)
Published Jan 18, 2022
in
math.CO
,
cs.IT
,
and
math.IT
Abstract
A code $\mathcal{C} \subseteq {0, 1, 2}n$ is said to be trifferent with length $n$ when for any three distinct elements of $\mathcal{C}$ there exists a coordinate in which they all differ. Defining $\mathcal{T}(n)$ as the maximum cardinality of trifferent codes with length $n$, $\mathcal{T}(n)$ is unknown for $n \ge 5$. In this note, we use an optimized search algorithm to show that $\mathcal{T}(5) = 10$ and $\mathcal{T}(6) = 13$.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.