Abstract
Among the models of delayed search discussed in [1], [2], the simplest one can be formulated as the following two–player game. One player, say A, holds a secret number \(m\in{\mathcal M}\triangleq\{1,2,\dots,M\}\) and another player, say Q, tries to learn the secret number by asking A at time i questions, like “Is m≥x i ?”, where x i is a number chosen by Q. The rule is that at time i + dA must answer Q ’s question at time i correctly and at time jQ can choose x j according to all answers he has received.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Amboinis, A., Bloch, S.A., Schweizer, D.L.: Delayed binary search, or playing twenty questions with a procrastinator. Algorithmica 32, 641–650 (2002)
Cicalese, F., Vaccaro, V.: Coping with delays and time–outs in binary search proceduresm. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 96–107. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ahlswede, R., Cai, N. (2006). A Kraft–Type Inequality for d–Delay Binary Search Codes. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_44
Download citation
DOI: https://doi.org/10.1007/11889342_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46244-6
Online ISBN: 978-3-540-46245-3
eBook Packages: Computer ScienceComputer Science (R0)