A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
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 thatdoi:10.1109/isit.1995.550309 fatcat:oaxaw2lmyvfz5n2zuwtud2epny