Skip to search formSkip to main contentSkip to account menu
Elements of Information Theory
TLDR
The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
View via Publisher
Nearest neighbor pattern classification
TLDR
The nearest neighbor decision rule assigns to an unclassified sample point the classification of the nearest of a set of previously classified points, so it may be said that half the classification information in an infinite sample set is contained in the nearest neighbor.
View via Publisher
Capacity theorems for the relay channel
TLDR
An achievable lower bound to the capacity of the general relay channel is established and superposition block Markov encoding is used to show achievability of C, and converses are established.
View via Publisher
Elements of information theory (2. ed.)
View Paper
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Network Information Theory
A system with many senders and receivers contains many new elements in the communication problem: interference, cooperation and feedback. These are the issues that are the domain of network…
View via Publisher
Universal Portfolios
We exhibit an algorithm for portfolio selection that asymptotically outperforms the best stock in the market. Let x i = (x i1 ; x i2 ; : : : ; x im) t denote the performance of the stock market on…
View via Publisher
Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition
  • T. Cover
  • Mathematics
    IEEE Trans. Electron. Comput.
  • 1 June 1965
TLDR
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 pattern-separating capacity of hyperplanes.
View via Publisher
Minimum complexity density estimation
TLDR
An index of resolvability is proved to bound the rate of convergence of minimum complexity density estimators as well as the information-theoretic redundancy of the corresponding total description length to demonstrate the statistical effectiveness of the minimum description-length principle as a method of inference.
View via Publisher
Broadcast channels
  • T. Cover
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1972
TLDR
This work introduces the problem of a single source attempting to communicate information simultaneously to several receivers and determines the families of simultaneously achievable transmission rates for many extreme classes of channels to lead to a new approach to the compound channels problem.
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License