- 1466 PROCEEDINGS OF THE IEEE, VOL. 68, NO. 12, DECEMBER 1980 Multiple User Information Theory
- IEEE TRANSACTIONSON INFORMATIONTHEORY,VOL. 40,NO. 4, JULY 1994 -, "The zero error capacity of a noisy channel," IRE Tmns.
- 2524 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 6, OCTOBER 1998 Comments on Broadcast Channels
- 837IEEETRANSACTIONSONINFORMATIONTHEORY,VOL.IT-30,N0. 6,NOVEmER1984 Correspondence
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-19, NO. 6, NOVEMBER 1973 827 Book Reviews
- THE PROBABILITY THAT A RANDOM GAME IS UNFAIR' Stanford University
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 1~24, NO. 3, MAY 1918 331 [24] A. N. Kolmogorov, "On the approximation of distributions of 1271 G. H. Hardy, J. E. Littlewood, and G. Polya, ZnequaIities. New
- MANAGEMENT SCIENCE Vol. 34, No. 6, June 1988
- 930 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT -29,NO. 6, NOVEMBER 1983 only linearly and not exponentially with the source block length.
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 37, NO. 2, MARCH 1991 269 Successive Refinement of Information
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 7, NOVEMBER 2000 2675 [13] H. K. Thapar and A. Patel, "A class of partial response systems for in-
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-18, NO. 1, JANUARY 1972 BroadcastChannels
- 1026 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 3, MAY 1998 The Efficiency of Investment Information
- 152 1EF.E TRANSACTIONS ON INFORMATION THEORY, VOL. IT-27.NO. 2, MARCH 1981 Asymmetries in Relativistic
- A Statistic for Measuring the Influence of Side Information in Investment
- 788 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-~, NO. 6, NOVEMBER 1987 Conditional Limit Theorems under
- IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS Geometrical and Statistical Properties of Systems of
- 50 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-14, NO. 1, JBNUARY 1968 simplifies the computations, up to Ic = 18. These are
- IEEE Tx.437sAcuoNs 0N INFORMATION THEORY,VOL. IT-16, NO. 2, MARCH 1970 The Two-Armed-Bandit Problem With
- 216 IEEE TRANSACTIONS ONINFORMATION THEORY,JANLJARY 1912 Admissibility Properties of Gilbert's Encoding for Unknown
- The Annals of Statistics 1973, Vol. 1, No. 5, 862-871
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-20, NO. 3, MAY 1974 CooPerativeBroadcastingA
- provide a way of predicting the performance of the Viterbi algorithm and gaining some insight into what machines will be
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-21, NO. 4, JULY 1975 Note that like PZ, the P in Theorem 7 is effective for PI
- OPERATIONS RESEARCH, Vol. 25, No. 5, September-October 1077 An Offensive Earned-Run Average for Baseball
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. ~~-24,NO. 4, JULY 1978 413 A Convergent Gambling Estimate of
- 292 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-2.7, NO. 3, MAY 1981 An Achievable Rate Region for the
- 152 IEEE TRANSACTIONSON COMMUNICATIONS, VOL. COM-30, NO. 1,JANUARY 1982 Optimal Sequence Detection and Optimal Symbol-by-
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-30,NO.2, MARCH1984 An Algorithm for Maximizing Expected
- where I is the N X N identity matrix, and D, = diag[02,ui2; ..,aiN] is a real diagonalmatrix. Because H has zero princlpal diagonal,
- SANDWICH PROOF OF AEP 901 Hk= E{ -log p(XklX,k-')) is equal to E{ -log p(XoIX~k))by stationarity,
- I72 IEEE TRANSACTIONS ON INFORMATION THEORY. VOL. 37. N O . I , JANUAKY I Y Y I A Straightforward simulation technique is adequate for error
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 40,NO. 3, MAY 1994 885 p;(gi = (I;.., 1) infinitely often) = I,
- 1850 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 5, MAY 2008 State Amplification
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 9, SEPTEMBER 2010 4181 Coordination Capacity
- ISIT2007, Nice, France, June 24 -June 29, 2007 Simultaneous Communication of Data and State
- ISIT2007, Nice, France, June 24 -June 29, 2007 Capacity of a Class of Deterministic Relay Channels
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-27, NO. 4, JULY 1981 483 Maximum Entropy and Conditional Probability
- 3072 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 7, NOVEMBER 2001 Substituting (49), (48), and (50) into (47), and using the fact that D is
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-19, NO. 1, JANUARY 1973 73 The limiting value of the lower bound for iI in
- sets, respectively; H(n) and T(n) are related by the output function e, and the state function f is defined by T(n $ 1) =
- 648 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-26, NO. 6, NOVEMBER 1980 Multiple Access Channels with
- ISIT2007, Nice, France, June 24 -June 29, 2007 Capacity of Coordinated Actions
- The Annals of Statistics 1975, Vol.3, No. 4, 939-946
- The AnnnLF of Probability 1988, Vol. 16, No. 2, 876-898
- SIAM J. MATRIX ANAL. APPL. Vol. 9, No. 3, July 1988
- 1418 IEEE TRANSACTIONS ON INFORMATIONTHEORY, VOL. 39, NO. 4, JULY 1993 The Entropy of Markov lkqjectories
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. ~-28, NO. 6, NOVEMBER 1982 Achievable Rates for Multiple Descriptions
- SIAM J. APPL. MATH. Vol. 15, No. 2, March, 1967
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 6, JUNE 2002 1629 Duality Between Channel Capacity and Rate
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-IS, NO. 1, JANUAR The author is grateful to Prof. S. J. Mason of M.I.T.
- GEOMETRICAL PROBABILITY AND RANDOM POINTS ON A HYPERSPHERE1
- 572 IEEE TRANSACTIONS ON INFORMATION THBORY, VOL. rr-25, NO. 5, SEFTBMBER 1979 ACKNOWLEDGMENT 171
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-27, NO. 4, JULY 1981 409 Asynchronous Multiple-Access
