Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes

Deppe C. Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes. DISCRETE MATHEMATICS. 2000;224(1-3):79-98.In this paper we determine the minimal number of yes-no queries that are needed to find an unknown integer between 1 and N, if at most three of the answers are lies. This strategy is also an optimal adaptive strategy for binary three-error-correcting codes. (C) 2000 Elsevier Science B.V. All rights reserved