Abbas El Gamal

Learn More
A relay channel consists of an input x,, a relay output yl, a cJmnnel output y, and a relay sender x2 (whose trasmission is allowed to depend on the past symbols y,). l%e dependence of the received symbols upm the inpnts is given by p(y,y,lx,,x,). ‘l%e channel is assumed to be memoryless. In this paper the following capacity theorems are proved. 1)(More)
These lecture notes have been converted to a book titled Network Information Theory published recently by Cambridge University Press. This book provides a significantly expanded exposition of the material in the lecture notes as well as problems and bibliographic notes at the end of each chapter. The authors are currently preparing a set of slides based on(More)
Gupta and Kumar (2000) introduced a random network model for studying the way throughput scales in a wireless network when the nodes are fixed, and showed that the throughput per source-destination pair is . Grossglauser and Tse (2001) showed that when nodes are mobile it is possible to have a constant or throughput scaling per source-destination pair. The(More)
A noisy network coding scheme for communicating messages between multiple sources and destinations over a general noisy network is presented. For multi-message multicast networks, the scheme naturally generalizes network coding over noiseless networks by Ahlswede, Cai, Li, and Yeung, and compress-forward coding for the relay channel by Cover and El Gamal to(More)
Consider a sequence of independent identically distributed (i.i.d.) random variables X,, X,, . ., X, and a distortion measure d( 4, ,$) on the estimates X, of X,. Two descriptions i(X) E { 1,2; , 2flRl) and j(X) E (1,2,...,2”R2] are given of the sequenceX=(X1,X2;..,Xn). From these two descriptions, three estimates J%?((i(X)), X,(j(X)), and X,( i( X), j(X))(More)
Gupta and Kumar (2000) introduced a random model to study throughput scaling in a wireless network with static nodes, and showed that the throughput per source-destination pair is &#920; (1/&#8730;<i>n</i> log <i>n</i>). Grossglauser and Tse (2001) showed that when nodes are mobile it is possible to have a constant throughput scaling per source-destination(More)
Manuscript received November 28, 1978; revised February 28, 1980. This work was supported in part by the National Science Foundation under Grant ENG 76-23334, in part by the Stanford Research Institute under International Contract D/&C-15-C-0187, and in part by the Joint Scientific Enaineerina Program under Contracts NO001475-C-0601 and F44620-76-C&01. This(More)
In this paper, we establish the capacity region of a class of deterministic interference channels with common information. For such a class of channels, each sender needs to transmit not only the private information but also certain common information to the corresponding receiver. Moreover, the channel outputs are deterministic with respect to given(More)
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. The problem is motivated by the following observation. With many channel coding schemes, the energy required to transmit a packet can be significantly reduced by lowering transmission(More)
Upper and lower bounds on the capacity and minimum energy-per-bit for general additive white Gaussian noise (AWGN) and frequency-division AWGN (FD-AWGN) relay channel models are established. First, the max-flow min-cut bound and the generalized block-Markov coding scheme are used to derive upper and lower bounds on capacity. These bounds are never tight for(More)