Random coding theorems for the general discrete memoryless broadcast channel
van der Meulen, E.
Information Theory, IEEE Transactions on
Volume 21, Issue 2, Mar 1975 Page(s): 180 - 190
Digital Object Identifier  
Summary: Three different communication situations are considered for the general nondegraded discrete memoryless broadcast channel with two components. In the most general situation, common and separate information is sent to both receivers. In another situation, only separate information is sent, and in a third, one Common and one separate message is sent. For each communication situation a random coding inner bound on the capacity region is derived. An example is presented which Shows that in the most general situation the inner bound strictly dominates the family of rates obtained by time-sharing. The capacity region for the general situation is characterized by a limiting expression. The relationship with the degraded broadcast channel and the connection with other multiway channels, such as the channel with two senders and two receivers, is shown.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.