Improving the Sphere-Packing Bound for Binary Codes over Memoryless Symmetric Channels

Kaveh Mahdaviani, Shervin Shahidi, Shima Haddadi +2

A lower bound on the minimum required code length of binary codes is obtained. The bound is obtained based on observing a close relation between the Ulam's liar game and channel co…