Multicast Achievable Rate Region of Deterministic Broadcast Channel

In this paper we address the problem of multicasting individual and common information from a single transmitter (source) to multiple receivers (destinations). We consider the general case where a separate message could be intended for any subset of destinations. We call this problem multicasting in broadcast channel. We derive an achievable rate region for this setup when the `deterministic channel model´ is employed. The achievable region is a function of link transfer functions and is characterized by a set of linear inequalities. We show that the obtained region is computable and convex. Moreover, we investigate the tightness of our achievable rate region for some well-known scenarios with up to three destinations. We verify that the derived multicast achievable regions for these particular cases coincide with the best known results in the literature which in fact characterize the multicast capacity regions for these scenarios.