In most statistical problems treated in the literature a datum of the problem is the information that the various distributions of the chance variables involved belong to given families ofâ€¦ (More)

Let X = I1, " '" , a}, Y = {1, ' " , b} be finite sets. A stochastic matrix w with a rows and b columns will be called a channel. X, Y are the input and output alphabets (respectively) of theâ€¦ (More)

" r? Let X~= X and Y~= Y for t = 1, 2 . . . . . X, ,= ~ X ~ and !1, = Y~. Let S be any set, cg = {w(. 1" I s ) lseS} t = l t = l n be a set of (a x 2) stochastic matrices w( ' l ' ls) , and St=S , t=â€¦ (More)

The strong converse for the discrete memoryless channel was proved by the author (Wolfowitz, 1957). (The result actually proved is stronger than the strong converse because of the O(~Â¢/n) term in theâ€¦ (More)