An algorithm for “Ulam's Game” and its application to error correcting codes

Abstract A near-optimal algorithm for “Ulam's Game” is presented. The relationship between the game and multiple error correcting codes is discussed. For many cases, codes derived from winning strategies of the game are optimal for the communication scheme with noisy forward and noiseless feedback channels.