Rate-splitting multiple access (RSMA) has emerged as a novel, general, and powerful
framework for the design and optimization of non-orthogonal transmission, multiple access …

A noisy network coding scheme for communicating messages between multiple sources and
destinations over a general noisy network is presented. For multi-message multicast …

This paper introduces a new and ubiquitous framework for establishing achievability results
in network information theory problems. The framework uses random binning arguments …

In this paper we review the theoretical and practical principles of the broadcast approach to
communication over state-dependent channels and networks in which the transmitters have …

The degrees-of-freedom of a K-user Gaussian interference channel (GIC) has been defined
to be the multiple of (1/2) log 2 P at which the maximum sum of achievable rates grows with …

For data streaming applications, existing solutions are not yet able to close the gap between
high data rates and low delay. This work considers the problem of data streaming under …

This paper introduces the notions of variable-to-fixed and fixed-to-variable channel capacity,
without feedback. For channels that satisfy the strong converse, these notions coincide with …

The optimal rate region for interference networks is characterized when encoding is
restricted to random code ensembles with superposition coding and time sharing. A simple …

This paper establishes inner bounds on the secrecy capacity regions for the general three-
receiver broadcast channel with one common and one confidential message sets. We …

It is shown that simultaneous nonunique decoding is rate-optimal for the general K-sender, L-
receiver discrete memoryless interference channel when encoding is restricted to randomly …