Abstract
What is the minimum number of yes-no questions needed to find an m bit number x in the set S = {0,1,...,2m — 1} if up to ℓ answers may be erroneous/false ? In case when the (t+1)th question is adaptively asked after receiving the answer to the tth question, the problem, posed by Ulam and Rényi, is a chapter of Berlekamp’s theory of error-correcting communication with feedback. It is known that, with finitely many exceptions, one can find x asking Berlekamp’s minimum number qℓ(m) of questions, i.e., the smallest integer q such that 2q ≥ 2m(( l q + ( l-1 q ) + ··· + 2 q +q+1): At the opposite, nonadaptive extreme, when all questions are asked in a unique batch before receiving any answer, a search strategy with qℓ(m) questions is the same as an ℓ-error correcting code of length qℓ(m) having 2m codewords. Such codes in general do not exist for ℓ > 1. Focusing attention on the case ℓ = 2; we shall show that, with the exception of m = 2 and m = 4, one can always find an unknown m bit number x ∈ S by asking q2(m) questions in two nonadaptive batches. Thus the results of our paper provide shortest strategies with as little adaptiveness/interaction as possible.
Partially supported by ENEA Phd Grant
Partially supported by COST ACTION 15 on Many-valued logics for computer science applications, and by the Italian MURST Project on Logic.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Aigner, Searching with lies, J. Combin. Theory, Ser. A, 74 (1995), pp. 43–56.
R. S. Borgstrom and S. Rao Kosaraju, Comparison-based search in the presence of errors, In: Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, San Diego, California, 16-18 May 1993, pp. 130–136.
E. R. Berlekamp, Block coding for the binary symmetric channel with noiseless, delayless feedback, In: Error-correcting Codes, H. B. Mann (Editor), Wiley, New York (1968), pp. 61–88.
A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, W. D. Smith, A New Table of Constant Weight Codes, IEEE Transactions on Information Theory, 36 (1990), pp. 1334–1380.
F. Cicalese, Q-ary searching with lies, in Proceedings of the Sixth Italian Conference on Theoretical Computer Science, Prato, Italy, (U. Vaccaro et al., Editors), World Scientific, Singapore, 1998, pp. 228–240.
J. Czyzowicz, D. Mundici, A. Pelc, Ulam’s searching game with lies, J. Combin. Theory, Ser. A, 52 (1989), pp. 62–76.
R. Hill, Searching with lies, In: Surveys in Combinatorics, Rowlinson, P. (Editor), Cambridge University Press (1995), pp. 41–70.
F. J. MacWilliams, N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
D. Mundici, A. Trombetta, Optimal comparison strategies in Ulam’s searching game with two errors, Theoretical Computer Science, 182 (1997), pp. 217–232.
A. Negro, M. Sereno, Ulam’s Searching game with three lies, Advances in Applied Mathematics, 13 (1992), pp. 404–428.
A. Pelc, Solution of Ulam’s problem on searching with a lie, J. Combin. Theory, Ser. A, 44 (1987), pp. 129–142.
A. Pelc, Searching with permanently faulty tests, Ars Combinatoria, 38 (1994), pp. 65–76.
A. Rényi, Napló az információelméletrol, Gondolat, Budapest, 1976. (English translation: A Diary on Information Theory, J. Wiley and Sons, New York, 1984).
J. Spencer, Ulam’s searching game with a fixed number of lies, Theoretical Computer Science, 95 (1992), pp. 307–321.
S. M. Ulam, Adventures of a Mathematician, Scribner’s, NewYork, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cicalese, F., Mundici, D. (1999). Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness. In: Nešetřil, J. (eds) Algorithms - ESA’ 99. ESA 1999. Lecture Notes in Computer Science, vol 1643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_23
Download citation
DOI: https://doi.org/10.1007/3-540-48481-7_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66251-8
Online ISBN: 978-3-540-48481-3
eBook Packages: Springer Book Archive