An inequality on guessing and its application to sequential decoding

E. Arikan
Proceedings of 1995 IEEE International Symposium on Information Theory  
Let (X, Y) be a pair of discrete random variables with X taking one of M possible values. Suppose the value of X is to be determined, given the value of Y, by asking questions of the form "Is X equal to z?" until the answer is "Yes." Let G(r 1 y) denote the number of guesses in any such guessing scheme when X = x, Y = y. We prove that
doi:10.1109/isit.1995.550309 fatcat:oaxaw2lmyvfz5n2zuwtud2epny