• Publications
  • Influence
Capacity theorems for the relay channel
  • T. Cover, A. Gamal
  • Computer Science, Mathematics
  • IEEE Trans. Inf. Theory
  • 1 September 1979
TLDR
A relay channel consists of an input x_{l} , a relay output y_{1} , and a relay sender x_{2} . Expand
Network Information Theory
TLDR
This comprehensive treatment of network information theory and its applications provides the first unified coverage of both classical and recent results. Expand
Throughput-delay trade-off in wireless networks
TLDR
This paper provides a definition of delay in ad hoc networks and obtains optimal throughput-delay trade-off in fixed and mobile wireless networks. Expand
Multiple access channels with arbitrarily correlated sources
TLDR
A source of independent identically distributed (i.i.d.) discrete random variables with joint probability mass function p(u,v) and common part w=f(u)=g(v) in the sense of Witsenhausen, Gacs, and Korner. It is shown that such a source can be sent with arbitrarily small probability of error over a multiple access channel (MAC) . Expand
Achievable rates for multiple descriptions
  • A. Gamal, T. Cover
  • Computer Science, Mathematics
  • IEEE Trans. Inf. Theory
  • 1 November 1982
TLDR
We find that the distortion constraints D_{0}, D_{1), D_{2} are achievable if there exists a probability mass distribution p(x)p(\hat{x}_{1}, X_{2}, \hat{X}_{0}|x) with Ed(X,\hat{ x}_{m})\leq D_{m}, m=0,1,2. Expand
Optimal throughput-delay scaling in wireless networks - part I: the fluid model
TLDR
We show that the optimal throughput-delay tradeoff is given by D(n)=Theta(nT(n)), where T(n) and D( n) are the throughput and delay scaling, respectively. Expand
Energy-efficient packet transmission over a wireless link
TLDR
The paper considers the problem of minimizing the energy used to transmit packets over a wireless link via lazy schedules that judiciously vary packet transmission times. Expand
Noisy Network Coding
TLDR
A noisy network coding scheme for communicating messages between multiple sources and destinations over a general noisy network is presented. Expand
Capacity theorems for relay channels
On the capacity of computer memory with defects
TLDR
A computer memory with defects is modeled as a discrete memoryless channel with states that are statistically determined. Expand
...
1
2
3
4
5
...