Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs

Per Austrin, Petteri Kaski, Mikko Koivisto +1

Two sets $A,B\subseteq \{0,1{\}}^n$ form a Uniquely Decodable Code Pair (UDCP) if every pair $a\in A$, $b\in B$ yields a distinct sum $a+b$, where the addition is over $\mathbb{…