Arıkan, ErdalBoztaş, S.2016-02-082016-02-082002-06-07http://hdl.handle.net/11693/27567Date of Conference: 30 June-5 July 2002Conference name: Proceedings IEEE International Symposium on Information Theory, 2002A practical algorithm was obtained for directly generating an optimal guessing sequence for guessing under lies. An optimal guessing strategy was defined as one which minimizes the number of average number of guesses in determining the correct value of a random variable. The information-theoretic bounds on the average number of guesses for optimal strategies were also derived.EnglishSequential decodingAlgorithmsConstraint theoryDecision theoryDynamic programmingInformation theoryProbability distributionsProblem solvingRandom processesSignal encodingDecodingConference Paper10.1109/ISIT.2002.1023480