Improved Upper Bound for the Size of a Trifferent Code

Siddharth Bhandari, Abhishek Khetan

A subset $\mathcal{C}\subseteq \{0,1,2{\}}^n$ is said to be a $\text{trifferent}$ code (of block length $n$) if for every three distinct codewords $x,y,z\in \mathcal{C}$, there is…