Title of article
Solution of Ulamʹs searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes Original Research Article
Author/Authors
Christian Deppe، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
20
From page
79
To page
98
Abstract
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.
Keywords
Transmission with feedback , Ulamיs game , Searching with lies
Journal title
Discrete Mathematics
Serial Year
2000
Journal title
Discrete Mathematics
Record number
950578
Link To Document