The following pages link to Thomas M. Cover (Q582858):
Displaying 50 items.
- Kolmogorov's contributions to information theory and algorithmic complexity (Q582861) (← links)
- Empirical Bayes stock market portfolios (Q1083349) (← links)
- Asymptotic optimality and asymptotic equipartiton properties of log- optimum investment (Q1101323) (← links)
- A sandwich proof of the Shannon-McMillan-Breiman theorem (Q1107656) (← links)
- On determining the irrationality of the mean of a random variable (Q1215369) (← links)
- A finite memory test of the irrationality of the parameter of a coin (Q1225405) (← links)
- The cost of achieving the best portfolio in hindsight (Q2757576) (← links)
- On the competitive optimality of Huffman codes (Q3197749) (← links)
- Monotonicity of Linear Separability Under Translation (Q3221438) (← links)
- On the similarity of the entropy power inequality and the Brunn- Minkowski inequality (Corresp.) (Q3221873) (← links)
- An information - theoretic proof of Hadamard's inequality (Corresp.) (Q3315430) (← links)
- An algorithm for maximizing expected log investment return (Q3329158) (← links)
- Channel Capacity and State Estimation for State-Dependent Gaussian Channels (Q3547680) (← links)
- State Amplification (Q3604503) (← links)
- Conditional limit theorems under Markov conditioning (Q3764957) (← links)
- Game-Theoretic Optimal Portfolios (Q3795445) (← links)
- Determinant Inequalities via Information Theory (Q3795799) (← links)
- A bound on the financial value of information (Q3813576) (← links)
- Gaussian feedback capacity (Q3824226) (← links)
- Capacity theorems for the relay channel (Q3853550) (← links)
- Competitive Optimality of Logarithmic Investment (Q3885563) (← links)
- Asymmetries in relativistic information flow (Q3908914) (← links)
- An achievable rate region for the multiple-access channel with feedback (Q3908922) (← links)
- Maximum entropy and conditional probability (Q3910426) (← links)
- Asynchronous multiple-access channel capacity (Q3910432) (← links)
- Multiple access channels with arbitrarily correlated sources (Q3919591) (← links)
- Optimal Sequence Detection and Optimal Symbol-by-Symbol Detection: Similar Algorithms (Q3944478) (← links)
- Achievable rates for multiple descriptions (Q3956849) (← links)
- Minimum complexity density estimation (Q3981153) (← links)
- Information theoretic inequalities (Q3987445) (← links)
- The entropy of a randomly stopped sequence (Q3987459) (← links)
- (Q4023085) (← links)
- (Q4041442) (← links)
- (Q4043996) (← links)
- Cooperative broadcasting (Q4048902) (← links)
- A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.) (Q4054910) (← links)
- An achievable rate region for the broadcast channel (Q4077190) (← links)
- (Q4096267) (← links)
- Optimal finite memory learning algorithms for the finite sample problem (Q4098493) (← links)
- Compound Bayes Predictors for Sequences with Apparent Markov Structure (Q4136384) (← links)
- On the Possible Orderings in the Measurement Selection Problem (Q4147429) (← links)
- A convergent gambling estimate of the entropy of English (Q4160824) (← links)
- Some equivalences between Shannon entropy and Kolmogorov complexity (Q4163107) (← links)
- The entropy of Markov trajectories (Q4307349) (← links)
- On the maximum entropy of the sum of two dependent random variables (Q4324193) (← links)
- The relative value of labeled and unlabeled samples in pattern recognition with an unknown mixing parameter (Q4336392) (← links)
- Universal Portfolios (Q4345877) (← links)
- The efficiency of investment information (Q4400321) (← links)
- The worst additive noise under a covariance constraint (Q4544756) (← links)
- Growth optimal investment in horse race markets with costs (Q4545815) (← links)
