An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel

Abstract

We prove a new upper bound on the size of codes $C \subseteq \{1,2,3,4\}^{n}$ with the property that every four distinct codewords in $C$ have a coordinate where they all differ. Specifically, we provide a self-contained proof that such codes have size at most $2^{6n/19 + o(n)}$ , that is, rate bounded asymptotically by 6/19 ≤ 0.3158 (measured in bits). This improves the previous best upper bound of 0.3512 due to (Arikan 1994), which in turn improved the 0.375 bound that followed from general bounds for perfect hashing due to (Fredman and Komlos, 1984) and (Korner and Marton, 1988). Finally, using a combination of our approach with a simple idea which exploits powerful bounds on the minimum distance of codes in the Hamming space, we further improve the upper bound to 0.31477.