DocumentCode :
2470253
Title :
The solution of a problem of Ulam on searching with lies
Author :
Hill, Ray ; Karim, Jehangir ; Berlekamp, Elwyn
Author_Institution :
Dept. of Comput. & Math. Sci., Salford Univ., UK
fYear :
1998
fDate :
16-21 Aug 1998
Firstpage :
244
Abstract :
We consider Ulam´s problem of determining the minimum number of yes-no queries to find an unknown integer between 1 and 220 if at most some given number e of the answers may be lies. Previously published papers have solved the problem for cases e=1,2,3 and 4. In this paper we solve the problem for all values of e
Keywords :
number theory; Ulam´s problem; minimum number of yes-no queries; unknown integer; Autobiographies; Block codes; Feedback; Mathematics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
Type :
conf
DOI :
10.1109/ISIT.1998.708849
Filename :
708849
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2470253
بازگشت