New outer bounds are demonstrated for the capacity regions of discrete memoryless interference channels and Gaussian interference channels. The bound for discrete channels coincides with the capacity region in special cases. The bound for Gaussian channels improves previous knowledge when the interference is of medium strength.

This paper is concerned with a communication channel with two senders and one receiver, in which each sender observes a private feedback signal. The two feedback signals are not necessarily equivalent to or derived from the signal observed by the receiver. An achievable rate region is demonstrated for this multiple-access channel by means of a new superposition coding scheme. In particular it is shown that a rate region, previously obtained for the multiple-access channel with "perfect" feedback to both senders, remains achievable when the feedback connection to one of the senders is eliminated.

An interference channel is a communication medium shared by M sender-receiver pairs. Transmission of information from each sender to its corresponding receiver interferes with the communications between the other senders and their receivers. This corresponds to a frequent situation in communications, and defines anM-dimensional capacity region. In this paper, we obtain general bounds on the capacity region for discrete memoryless interference channels and for linear-superposition interference channels with additive white Gaussian noise. The capacity region is determined in special cases.

Wyner recently introduced the concept of a wiretap channel and showed that by transmitting at a rate less than capacity on the main link it was possible to keep the wiretapper's information about the entire message equal to zero. It is shown that it is possible to send at capacity on the main link and still keep the wiretapper's information equal to zero on many, large, arbitrary portions of the message.

Packet switching has found widespread application in computer communications because of its ability to efficiently handle high ratios of peak-to-average data rate. Packet radio is the application of packet switching techniques to radio channels. The resultant multiple-access problem requires novel approaches. Such approaches have been developed by others and have primarily been analyzed in steady-state behavior. This paper demonstrates and analyzes an important aspect of the dynamic characteristics of packet radio, namely, that of bistable behavior. That is, the system possesses two statistically stable equilibrium points, one in a desirable low-delay region, and the other in an undesirable high-delay region. Since the stability is only statistical in nature, the system oscillates between these two points. Even if the resultant steady-state behavior is very poor, this dynamic analysis frequently shows that system performance will be acceptable. This is due to quiet periods (such as at night) which allow the system to recover.

It is shown that, under certain conditions, two strongly interfering communication links with additive white Gaussian noise can achieve rates as high as would be achievable without this interference.