The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best
known upper bound on the capacity of the Gaussian relay channel. We develop a new …

This paper employs auxiliary receivers as a mathematical tool to identify Gallager-type
auxiliary random variables and write outer bounds for some basic multiuser settings. This …

We consider the discrete memoryless symmetric primitive relay channel, where, a source
wants to send information to a destination with the help of a relay and the relay can …

We consider the primitive relay channel, where the source sends a message to the relay and
to the destination, and the relay helps the communication by transmitting an additional …

We revisit the primitive relay channel, introduced by Cover in 1987. Recent work derived
upper bounds on the capacity of this channel that are tighter than the classical cutset bound …

Consider a primitive diamond relay channel, where a source X wants to send information to
a destination with the help of two relays Y 1 and Y 2, and the two relays can communicate to …

This paper considers the distributed information bottleneck (D-IB) problem for a primitive
Gaussian diamond channel with two relays and MIMO Rayleigh fading. The channel state is …

Consider a primitive relay channel, where, a source X wants to send information to a
destination Y with the help of a relay Z and the relay can communicate to the destination via …

We revisit the primitive relay channel, introduced by Cover in 1987. Previously, the cut-set
bound was shown to be loose for the primitive relay channel, in the discrete memoryless and …

Katalin Marton's Lasting Legacy Page 1 1 Katalin Marton’s Lasting Legacy Abbas El
Gamal∗ and Robert M. Gray† I. INTRODUCTION Katalin Marton (December 9, 1941 …