Learn More
—An achievable region for the-channel multiple description coding problem is presented. This region generalizes two-channel results of El Gamal and Cover and of Zhang and Berger. It further generalizes three-channel results of Gray and Wyner and of Zhang and Berger. A source that is successively refinable on chains is shown to be successively refinable on(More)
A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this paper. Specifically, it is shown that if the channel coefficients and power constraints satisfy a simple condition then(More)
—Capacity regions are established for several two-sender, two-receiver channels with partial transmitter cooperation. First, the capacity regions are determined for compound multiple-access channels (MACs) with common information and compound MACs with conferencing. Next, two interference channel models are considered: an interference channel with common(More)
— We consider the problem of source coding with receiver side information for the simple network proposed by R. Gray and A. Wyner in 1974. In this network, a transmitter must reliably transport the output of two correlated information sources to two receivers using three noiseless channels: a public channel which connects the transmitter to both receivers,(More)
The problem of a nomadic terminal sending information to a remote destination via agents with lossless connections to the destination is investigated. Such a setting suits, e.g. access points of a wireless network where each access point is connected by a wire to a wireline-based network. The Gaussian codebook capacity for the case where the agents do not(More)