#### Filter Results:

- Full text PDF available (74)

#### Publication Year

1965

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Thomas M. Cover, Peter E. Hart
- IEEE Trans. Information Theory
- 1967

for some very helpful discussions, and Prof. D. E. Troxel for his help in designing the sensory display.

- Thomas M. Cover, Abbas El Gamal
- IEEE Trans. Information Theory
- 1979

- Thomas M. Cover
- IEEE Trans. Electronic Computers
- 1965

This paper develops the separating capacities of families of nonlinear decision surfaces by a direct application of a theorem in classical combinatorial geometry. It is shown that a family of surfaces having d degrees of freedom has a natural separating capacity of 2d pattern vectors, thus extending and unifying results of Winder and others on the… (More)

- Thomas M. Cover
- IEEE Trans. Information Theory
- 1972

We introduce the problem of a single source attempting to communicate information simultaneously to several receivers. The intent is to model the situation of a broadcaster with multiple receivers or a lecturer with many listeners. Thus several different channels with a common input alphabet are specified. We shall determine the families of simultaneously… (More)

This chapter introduces most of the basic definitions required for the subsequent development of the theory. It is irresistible to play with their relationships and interpretations, taking faith in their later utility. After defining entropy and mutual information, we establish chain rules, the non-negativity of mutual information, the data processing… (More)

- Amir Dembo, Thomas M. Cover, Joy A. Thomas
- IEEE Trans. Information Theory
- 1991

The role of inequalities in information theory is reviewed and the relationship of these inequalities to inequalities in other branches of mathematics is developed. I NEQUALITIES in information theory have been driven by a desire to solve communication theoretic problems. To solve such problems, especially to prove converses for channel capacity theorems,… (More)

- Suhas N. Diggavi, Thomas M. Cover
- IEEE Trans. Information Theory
- 2001

and using the fact that D is self-orthogonal, we obtain p02 l=1 right-hand side of (44) = 1 jDj (p 2) n + p02 l=0 r r r A r r r(0p) r h(l) where h(l) = (p 0 1) l(p+1) p02 s=0 rs s(p+1) = 1 jDj (p 2) n + p02 l=0 r r r Ar r r(0p) n = 1 jDj (p 2) n + (p 0 1) (0p) n and the assertion of the lemma follows. REFERENCES [1] A. Ashikhmin and S. Litsyn, " Upper… (More)

- Thomas M. Cover
- IEEE Trans. Information Theory
- 1975

provide a way of predicting the performance of the Viterbi algorithm and gaining some insight into what machines will be improved with the use of context.