Publications of Thomas M. Cover
Current as of: June 20, 2002
Papers
- T. Cover. Geometrical and Statistical Properties of Linear Threshold Devices (Ph.D. thesis). Stanford Electronics Laboratories Thenical Report #6107-1 , May 1964.
2. T. Cover. Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition. IEEE Transactions on Electronic Computers, EC-14(3):326--334, June 1965. Reprinted in Artificial Neural Networks: Concepts and Theory, IEEE Computer Society Press, Los Alamitos, Calif., 1992, eds. P. Mehra and B. Wah.
3. T. Cover. Behavior of Sequential Predictors of Binary Sequences. Transactions of the Fourth Prague Conference on Information Theory, Prague, September 1966.
4. T. Cover. The Probability that a Random Game is Unfair. Ann. Math. Stat., 37(6):1796--1799, December 1966.
5. T. Cover and P. Hart. Nearest Neighbor Pattern Classification. IEEE Trans. on Information Theory, IT-13(1):21--27, January 1967. Reprinted in Pattern Recognition, Chinese University Press, Hong Kong, 1980. ed. by K.S. Fu.
6. T. Cover and B. Efron. Geometrical Probability and Random Points on a Hypersphere. Ann. Math Stat., 38(1):213-220, February 1967.
7. T. Cover. The Number of Linearly Inducible Orderings of Points in d-Space. SIAM Journal on Applied Math., 15(2), March 1967.
8. T. Cover. Review of Optimum Seeking Methods by D. Wilde, Zentralblatt fur Mathematik, 1967.
9. T.Cover. Rates of Convergence for Nearest Neighbor Procedures. Proceedings of The Hawaii International Conference on System Sciences, Honolulu, Hawaii, January 1968.
10. T. Cover. Estimation by the Nearest Neighbor Rule. IEEE Trans. on Information Theory, IT-14(1):50--55, January 1968.
11. T. Cover. A Note on the Two-Armed Bandit Problem with Finite Memory. Information and Control, 12(5/6):371--377, May-June 1968.
12. T. Cover. Capacity Problems for Linear Machines. Chapter in the book Pattern Recognition, Thompson Book Co., 1968. ed. by L. Kanal.
13. T. Cover. Comments on the paper Asymptotically Optimal Discriminant Functions for Pattern Classification by C. Wolverton and T. Wagner. IEEE Trans. on Information Theory, IT-15(2):265, March 1969.
14. T. Cover. Hypothesis Testing with Finite Statistics. Ann. Math. Stat., 40(3):828--835, June 1969.
15. T. Cover. Learning in Pattern Recognition. Chapter in the book Methodologies of Pattern Recognition, Academic Press, New York, 1969. ed. by S. Watanabe.
16. T. Cover and M. Hellman. The Two-Armed-Bandit Problem with Time-Invariant Finite Memory. IEEE Trans. on Information Theory, IT-16(2):185--195, March 1970.
17. M. Hellman and T. Cover. Comments on `Automata in Random Media.' Problems of Information Transmission, 6(2):21--30, March 1970. (Russian, Subsequently translated.)
18. M. Hellman and T. Cover. Learning with Finite Memory. Ann. Math. Stat., 41(3):765--782, June 1970. Russian translation: ``Obucheniye c Konechnoy Pamyatyu,'' Matematika, 17(3):137-156, 1973.
19. T. Cover and M. Hellman. Finite-Memory Hypothesis Testing -- Comments on a Critique. IEEE Trans. on Information Theory, IT-16(4):496--497, July 1970.
20. M. Hellman and T. Cover. On Memory Saved by Randomization. Ann. Math. Stat., 42(3):1075--1078, June 1971.
21. T. Cover. Broadcast Channels. IEEE Trans. on Information Theory, IT-18(1):2--14, January 1972. Reprinted in Record of COMSAT, seminar on Multiple User Communications, UPO43CL, Clarksburg, Maryland, May 1975. Reprinted in Key Papers in the Development of Information Theory. IEEE Press, 1974. ed. by D. Slepian.
22. T. Cover. Admissibility Properties of Gilbert's Encoding for Unknown Source Probabilities. IEEE Trans. on Information Theory, IT-18(1):216--217, January 1972.
23. T. Cover. Review of book Introduction to Statistical Pattern Recognition by K. Fukunaga. Industrial Bookshelf, 1(16):3, 1972.
24. T. Cover. A Hierarchy of Probability Density Function Estimates. Chapter in Frontiers of Pattern Recognition, Academic Press, New York, 1972. ed. by S. Watanabe.
25. T. Cover. Enumerative Source Encoding. IEEE Trans. on Information Theory, IT-19(1):73--77, January 1973.
26. T. Cover. On Determining the Irrationality of the Mean of a Random Variable. Ann. of Statistics, 1(5):862--871, September 1973.
27. T. Cover. Generalization on Patterns Using Kolmogorov Complexity. Proceedings of the First Int'l Joint Conference on Pattern Recognition, Washington, D.C., October 1973.
28. T. Cover. Review of Five Books in Pattern Recognition. IEEE Trans. on Information, IT-19(6):827--833, November 1973.
29. M. Hellman and T. Cover. A Review of Recent Results on Learning with Finite Memory. Problems of Control and Information Theory, 221-227, 1973.
30. T. Cover. The Best Two Independent Measurements are Not the Two Best. IEEE Trans. on Systems, Man and Cybernetics, SMC-4(1):116--117, January 1974.
31. T. Cover and P. Bergmans. Cooperative Broadcasting. IEEE Trans. on Information Theory, IT-20(3):317--324, May 1974. Reprinted in Multiple Access Communications: Foundations for Emerging Technologies, ed. by N. Abramson, pp. 18-25, IEEE Press, 1993.
32. T. Cover. Universal Gambling Schemes & the Complexity Measures of Kolmogorov & Chaitin. Stanford University Dept. of Statistics Technical Report No. 12, October 1974.
33. T. Cover. A Proof of the Data Compression Theorem of Slepian and Wolf for Ergodic Sources. IEEE Trans. on Information Theory, IT-21(2):226--228, March 1975. Reprinted in Ergodic and Information Theory, L. Davisson, R. Gray (eds), Benchmark Papers in Electrical Engineering and Computer Science, Dowden, Hutchinson, and Ross, Penn. (Part V, pp. 305-307.)
34. T. Cover. Some Advances in Broadcast Channels. Chapter in the book Advances in Communication Theory, Academic Press, San Francisco, 1975. ed. by A. Viterbi. (Volume 4 of Theory and Applications).
35. T. Cover. An Achievable Rate Region for the Broadcast Channel. IEEE Trans. on Information Theory, IT-21(4):399--404, July 1975.
36. P. Hirschler and T. Cover. A Finite Memory Test of the Irrationality of the Parameter of a Coin. Annals of Statistics, 3(4):939-946, July 1975.
37. T. Cover. Open Problems in Information Theory. IEEE USSR Joint Workshop on Information Theory, IEEE Press, 35 - 36, December 1975.
38. T. Cover and T. Wagner. Topics in Statistical Pattern Recognition. Chapter in Digital Pattern Recognition Communication and Cybernetics 10, 15 - 46, Springer Verlag, 1976. ed. by K.S. Fu.
39. T. Cover, M. Freedman, and M. Hellman. Optimal Finite Memory Learning Algorithms for the Finite Sample Problem. Information and Control, 30(1):49-85, January 1976.
40. T. Cover and A. Shenhar. Compound Bayes Predictors for Sequences with Apparent Markov Structure. IEEE Trans. on Systems, Man and Cybernetics, SMC-7(6):421--424, June 1977.
41. T. Cover. Comments on Stone's Paper. Annals of Statistics, 5(4):627-628, July 1977.
42. T. Cover and J. Van Campenhout. On the Possible Orderings in the Measurement Selection Problem. IEEE Trans. on Systems, Man and Cybernetics, SMC-7(9):657--661, September 1977.
43. T. Cover and C. Keilers. An Offensive Earned-Run Average for Baseball. JORSA, 25(5):729-740, Sept-Oct 1977.
44. S.K. Leung and T. Cover. Some Equivalences Between Shannon Entropy and Kolmogorov Complexity. IEEE Trans. on Information Theory, IT-24(3):331--338, May 1978.
45. T. Cover and R. King. A Convergent Gambling Estimate of the Entropy of English. IEEE Trans. on Information Theory, IT-24(4):413--421, July 1978.
46. T. Cover and A. El Gamal. Capacity Theorems for the Relay Channel. IEEE Trans. on Information Theory, IT-25(5):572--584, September 1979.
47. T. Cover. Relativistic Information Flow and the Twin Paradox. The Stanford Engineer, Fall/Winter:25--28, 1979.
48. R. Bell and T. Cover. Competitive Optimality of Logarithmic Investment. Mathematics of Operations Research, 5(2):161--166, May 1980.
49. T. Cover. Problems appearing in Gentle Diversions. IEEE Communications Magazine, January 1979 (1 problem), July 1980 (3 problems). ed. by S. Hill.
50. T. Cover, A. El Gamal, and M. Salehi. Multiple Access Channels with Arbitrarily Correlated Sources. IEEE Trans. on Information Theory, IT-26(6):648--657, November 1980.
51. A. El Gamal and T. Cover. Multiple User Information Theory. Proceedings of the IEEE, 68(12):1466--1483, December 1980. Reprinted in Multiple Access Communications: Foundations for Emerging Technologies, ed. by N. Abramson, pp. 26-43, IEEE Press, 1993.
52. K. Jarett and T. Cover. Asymmetries in Relativistic Information Flow. IEEE Trans. on Information Theory, IT-27(2):152--159, March 1981.
53. T. Cover and S.K. Leung. An Achievable Rate Region for the Multiple-Access Channel with Feedback. IEEE Trans. on Information Theory, IT-27(3):292--298, May 1981.
54. J. Van Campenhout and T. Cover. Maximum Entropy and Conditional Probability. IEEE Trans. on Information Theory, IT-27(4):483--489, July 1981.
55. T. Cover, R. McEliece, and E. Posner. Asynchronous Multiple-Access Channel Capacity. IEEE Trans. on Information Theory, IT-27(4):409--413, July 1981.
56. T. Cover. Multiple User Information Theory for the Gaussian Channel. New Concepts in Multi-User Communication, Series E: Applied Sciences(43):53-61, 1981. NATO Advanced Study Institutes Series. ed. by J.K.Skwirzynski.
57. J.F. Hayes, T. Cover, and J. Riera. Optimal Sequence Detection and Optimal Symbol-by-Symbol Detection: Similar Algorithms. IEEE Trans. on Communication Theory, COM-30(1):152--157, January 1982.
58. T. Cover. Historical Comments on Nearest Neighbor Pattern Classification. Citation Classics, (13):20, March 1982.
59. A. El Gamal and T. Cover. Achievable Rates for Multiple Descriptions. IEEE Trans. on Information Theory, IT-28(6):851--857, November 1982.
60. T. Cover and A. El Gamal. An Information Theoretic Proof of Hadamard's Inequality. IEEE Trans. on Information Theory, IT-29(6):930--931, November 1983.
61. T. Cover. An Algorithm for Maximizing Expected Log Investment Return. IEEE Trans. on Information Theory, IT-30(2):369--373, March 1984.
62. B.S. Choi and T. Cover. An Information Theoretic Proof of Burg's Maximum Entropy Spectrum. Proceedings of the IEEE, 72(8):1094--1095, August 1984.
63. M. Costa and T. Cover. On the Similarity of the Entropy Power Inequality and the Brunn Minkowski Inequality. IEEE Trans. on Information Theory, 30:837--839, November 1984.
64. A. Bruckstein and T. Cover. Monotonicity of Linear Separability under Translation. IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-7(3):355--358, May 1985.
65. T. Cover. Kolmogorov Complexity, Data Compression and Inference. Chapter in The Impact of Processing Techniques on Communications. Series E: Applied Sciences(91), Martinus Nijhoff Publishers, 1985. ed. by J. Skwyrzynski.
66. T. Cover. Review of ``Probability and Information'' by A. Yaglom & I. Yaglom. Journal of the American Statistical Association, Vol. 81, No. 393, pp. 265-266. March 1986.
67. T. Cover and D. Gluss. Empirical Bayes Stock Market Portfolios. Advances in Applied Mathematics, (7):170-181, 1986. Summary of this paper appears in: Proceedings of Conference Honoring Herbert Robbins, Springer-Verlag, 1986. Abstract and Summary appears in ``Adaptive Statistical Procedures and Related Topics,'' IMS Lecture Notes Monograph Series, Vol. 8, ed. by J. Van Ryzin.
68. T. Cover and B. Gopinath (editors). Open Problems in Communication and Computation. Springer-Verlag, 1987.
69. T. Cover. Conjecture: Feedback Doesn't Help Much. Chapter in Open Problems in Communication and Computation. Springer-Verlag, 1987.
70. T. Cover. The Capacity of the Relay Channel. Chapter in Open Problems in Communication and Computation. Springer-Verlag, 1987.
71. T. Cover. Simplex Conjecture. Chapter in Open Problems in Communication and Computation. Springer-Verlag, 1987.
72. T. Cover. Finite Memory Clocks. Chapter in Open Problems in Communication and Computation. Springer-Verlag, 1987.
73. T. Cover. Communication Complexity of Shifts. Chapter in Open Problems in Communication and Computation. Springer-Verlag, 1987.
74. T. Cover. Pick the Largest Number. Chapter in Open Problems in Communication and Computation. Springer-Verlag, 1987.
75. T. Cover. Ergodic Process Selection. Chapter in Chapter in Open Problems in Communication and Computation. Springer-Verlag, 1987.
76. T. Cover. Gambler's Ruin: A Random Walk on the Simplex. Chapter in Open Problems in Communication and Computation. Springer-Verlag, 1987.
77. T. Cover. Linear Separability. Chapter in the book Open Problems in Communication and Computation, Springer-Verlag, New York, 1987.
78. T. Cover. Figure-Ground Problem for Sound. Chapter in Open Problems in Communication and Computation. Springer-Verlag, 1987.
79. T. Cover. The Entropy of Power Inequality and the Brunn-Minkowski Inequality. Chapter in Open Problems in Communication and Computation. Springer-Verlag, 1987.
80. B.S. Choi and T. Cover. A Proof of Burg's Theorem. Maximum-Entropy and Bayesian Spectral Analysis and Estimation Problems, 75-84, D. Reidel Publication Company, 1987. ed. C.R. Smith and G. J. Erickson.
81. I. Csiszar, T. Cover and B.S. Choi. Conditional Limit Theorems under Markov Conditioning. IEEE Transactions on Information Theory, IT-33(6): 788-801, November 1987.
82. T. Cover. Log Optimal Portfolios. Chapter in Gambling Research: Gambling and Risk Taking, Seventh International Conference, Vol 4: Quantitative Analysis and Gambling, ed. by W.E. Eadington, 1987, Reno, Nevada.
83. P. Algoet and T. Cover. Asymptotic Optimality and Asymptotic Equipartition Properties of Log-Optimum Investment. The Annals of Probability, 16(2): 876-898, 1988.
84. P. Algoet and T. Cover. A Sandwich Proof of the Shannon-McMillan-Breiman Theorem. The Annals of Probability, 16(2): 899-909, 1988.
85. R. Bell and T. Cover. Game-Theoretic Optimal Portfolios. Management Science, 34(6): 724-733, June 1988.
86. T. Cover. The Role of Feedback in Communication. Chapter in Performance Limits in Communication Theory and Practice. Series E: Applied Sciences, Kluwer Academic Publishers, 225-235, 1988.
87. T. Cover and J. Thomas. Determinant Inequalities via Information Theory. SIAM J. Matrix Anal. Appl., 9(3): 384-392, July 1988.
88. A. Barron and T. Cover. A Bound on the Financial Value of Information. IEEE Transactions of Information Theory., 34(5): 1097-1100, September 1988.
89. T. Cover and S. Pombra. Gaussian Feedback Capacity. IEEE Transactions on Information Theory, 35(1): 37-43, January, 1989.
90. T. Cover, P. Gacs and R. Gray. Kolmogorov's Contributions to Information Theory and Algorithmic Complexity. The Annals of Probability, 17(3): 840-865, July, 1989.
91. T. Cover. Do Longer Games Favor the Stronger Player? The American Statistician, 43(4): 277-278, November, 1989.
92. H. Stern and T. Cover. Maximum Entropy and the Lottery. JASA, 84(408): 980-985, December, 1989.
93. T. Cover. On the Competitive Optimality of Huffman Codes. IEEE Transactions on Information Theory, 37(1): 172-174, January 1991.
94. T. Cover. Universal Portfolios. Mathematical Finance, 1(1): 1-29, January 1991.
95. W. Equitz and T. Cover. Successive Refinement of Information. IEEE Transactions on Information Theory, 37(2): 269-275, March 1991.
96. A. Barron and T. Cover. Minimum Complexity Density Estimation. IEEE Transactions on Information Theory, 37(4): 1034-1054, July 1991.
97. L. Ekroot and T. Cover. The Entropy of a Randomly Stopped Sequence. IEEE Transactions on Information Theory, 37(6):1641-1644, November, 1991.
98. A. Dembo, T.Cover and J. Thomas. Information Theoretic Inequalities. IEEE Transactions on Information Theory, 37(6):1501-1518, November 1991.
99. T. Cover, Invited response to G. Gilder's article on ``Hillis vs. the Law of the Microcosm,'' Upside, pp.95-96, March 1992.
100. T. Cover, 1990 Shannon Lecture, IEEE Information Theory Newsletter, pp.1,3-6, December 1992.
101. J. Thomas and T. Cover. Data Compression. Chapter in Handbook of Electrical Engineering, ed. by Richard Dorf, CRC Press, pp.1517-1527, 1993.
102. L. Ekroot and T. Cover. The Entropy of Markov Trajectories, IEEE Transactions on Information Theory, 39(4):1418-1421, July 1993.
103. T. Cover. Book review of Complexity, Entropy and the Physics of Information edited by W. Zurek, IEEE Transactions on Information Theory, 40(1):286-287, January 1994.
104. T. Cover. What Processes Satisfy the Second Law? Chapter in Physical Origins of Time Asymmetry, J.J. Halliwell, J. Perez-Mercader and W.H. Zurek, eds., pp. 98-107, Cambridge University Press, New York, 1994.
105. S. Pombra and T. Cover. Non-White Gaussian Multiple Access Channels with Feedback, IEEE Transactions on Information Theory, 40(3):885-892, May 1994.
106. T. Cover and Z. Zhang. On the Maximum Entropy of the Sum of Two Dependent Random Variables. IEEE Transactions on Information Theory, 40(4):1244-1246, July 1994.
107. V. Castelli and T. Cover. On the Exponential Value of Labeled Samples. Pattern Recognition Letters, 16:105-111, January 1995.
108. J. Thomas and T. Cover. Information Theory. Article in Collier's Encyclopedia, 1995-1997.
109. T. Cover and E. Ordentlich. Universal Portfolios with Side Information. IEEE Transactions on Information Theory, 42(2):348-363, March 1996.
110. V. Castelli and T. Cover. The Relative Value of Labeled and Unlabeled Samples in Pattern Recognition with and Unknown Mixing Parameter. IEEE Transactions on Information Theory, 42(6):2102-2117, November 1996.
111. E. Erkip and T. Cover. The Efficiency of Investment Information. IEEE Transactions on Information Theory, 4(3):1026-1040, May 1998.
112. T. Cover. Shannon and Investment. IEEE Information Theory Society Newsletter, special Golden Jubilee issue, pp.10-11, summer 1998.
113. T. Cover. Shannon Reminiscences. IEEE Information Theory Society Newsletter, special Golden Jubilee issue, pp.18-19, summer 1998.
114. T. Cover. Comments on Broadcast Channels. IEEE Transactions on Information Theory, 44(6):2524-2530, October 1998.
115. E. Ordentlich and T. Cover. The Cost of Achieving the Best Portfolio in Hindsight. Mathematics of Operations Research, 23(4):960-982, November 1998.
116. G. Iyengar and T. Cover. Growth Optimal Investment in Horse Race Markets with Costs, IEEE Transactions on Information Theory, 46(7):2675-2683, November 2000.
117. S. Diggavi and T. Cover. The Worst Additive Noise Under a Covariance Constraint, IEEE Transactions on Information Theory, 47(7):3072-3081, November 2001.
118. S. Golomb, E. Berlekamp, T. Cover, R. Gallager, J. Massey, and A. Viterbi, ``Claude Elwood Shannon (1916-2001)'', Notices of the American Mathematical Society, 49(1):8-16, January 2002.
119. T. Cover and M. Chiang. Duality Between Channel Capacity and Rate Distortion with Two-Sided State Information, IEEE Transactions on Information Theory , 48(6):1629-1638, June 2002.
Books
- T. Cover and B. Gopinath, eds., Open Problems in Communication and Computation, Springer-Verlag, New York, 1987.
2. T. Cover and J. Thomas, Elements of Information Theory, Wiley & Sons, New York, 1991.
Preprints
- A. Sutivong, M. Chiang, T. Cover and Y.H. Kim. Pure Information and State Estimation for State-Dependent Gaussian Channels, submitted to IEEE Transactions on Information Theory , 2002.
Recent conference proceedings
- T. Cover and E. Ordentlich. The equivalence of optimal market gain and minimax regret universal portfolios, Proceedings of IEEE International Symposium on Information Theory, June 1997, Ulm, Germany, p. 282.
2. S. Diggavi and T. Cover. Is maximum entropy noise the worst?, Proceedings of IEEE International Symposium on Information Theory, June 1997, Ulm, Germany, p. 278.
3. E. Erkip and T. Cover. The initial efficiency of investment for the general market, Proceedings of 1997 IEEE International Symposium on Information Theory, June 1997, Ulm, Germany, page 283.
4. T. Cover and E. Ordentlich. Universal portfolios with short sales and margin, Proceedings of IEEE International Symposium on Information Theory, June 1998, p. 174.
5. T. Cover and G. N. Iyengar. Growth optimal policies with transaction costs, Proceedings of the IEEE International Symposium on Information Theory, August 1998.
6. Thomas M. Cover and D. Julian. Performance of Universal Portfolios in the Stock Market, Proceedings of IEEE International Symposium on Information Theory, Sorrento, Italy, June 2000, p. 232.
7. M. Chiang and T. Cover. Duality and a Proof of Capacity for a Class of Channels with State Information, Proceedings of IEEE International Symposium on Information Theory and Applications, Honolulu, Hawaii, November 2000.
8. M. Chiang and T. Cover. Parallel Gaussian Feedback Channel Capacity, Proceedings of IEEE International Symposium on Information Theory and Applications, Honolulu, Hawaii, November 2000.
9. M. Chiang, A. Sutivong, and T. Cover. Channel Capacity and State Estimation, Proceedings of IEEE International Symposium on Information Theory and Applications, Honolulu, Hawaii, November 2000, pp. 838-840.
10. M. Chiang and T. Cover. Unified Duality of Channel Capacity and Rate Distortion with State Information, Proceedings of IEEE International Symposium on Information Theory, Washington D.C., June 2001.
11. A. Sutivong, T. Cover, and M. Chiang. Trade-off Between Message and State Information Rates Proceedings of IEEE International Symposium on Information Theory, Washington D.C., June 2001.
12. W. Yu, A. Sutivong, D. Julian, T. Cover, and M. Chiang. Writing on Colored Paper, Proceedings of IEEE International Symposium on Information Theory, Washington D.C., June 2001.
13. A. Sutivong and T. Cover. Rate vs. Distortion Trade-off for Channels with State Information, IEEE International Symposium on Information Theory, Lausanne, Switzerland, June 2002.
14. D. Julian and T. Cover. Concavity in Time of Conditional Entropy for Stationary Markov Sources, IEEE International Symposium on Information Theory, Lausanne, Switzerland, June 2002.
