New Upper Bound for Vector Trifferent Codes Improves Classical Limits

Researchers proved vector trifferent codes satisfy |C| ≤ (√2+o(1))·(3/2)^n, tightening the factor 2, and showed improvement |C| ≲ n^{-1/4}·(3/2)^n. Read more: getnews.me/new-upper-bound-for-vect... #vectortrifferent #codingtheory