A secure storage code maps source symbols, each of bits, to coded symbols, each of bits,
such that each coded symbol is stored in a node of a graph (one may view a node as a …

We present an inner bound for the combination network based on superposition coding and
partial interference decoding. This inner bound is tight in the three-user and K-user …

A novel class of achievable rate regions is obtained for the general-receiver discrete
memoryless broadcast channel over which two groupcast messages are to be transmitted …

Using an order-theoretic approach, a novel achievable rate region is obtained for the K-
receiver discrete memoryless broadcast channel with two nested messages, one message …

The K-user discrete memoryless (DM) broadcast channel (BC) with two nested multicast
messages is studied in which one common message is to be multicast to all receivers and …

Multiple groupcasting over the broadcast channel (BC) is studied in a special setting. In
particular, an inner bound is obtained for the-receiver discrete memoryless (DM) BC for the …

A novel class of achievable rate regions is obtained for the K-receiver broadcast channel
with two groupcast messages. The associated achievability schemes are parameterized by …

Multiple groupcasting over the broadcast channel (BC) is studied in a special setting. In
particular, an inner bound is obtained for the K-receiver discrete memoryless (DM) BC for …

Finding theoretical limits on the performance of communication systems and designing
schemes to achieve them is one of the fundamental questions in information theory. This …

The K-user discrete memoryless (DM) broadcast channel (BC) with two nested multicast
messages is studied in which one common message is to be multicast to all receivers and …