A proof of Martonapos;s coding theorem for the discrete memoryless broadcast channel (Corresp.)
El Gamal, A.; van der Meulen, E.
Information Theory, IEEE Transactions on
Volume 27, Issue 1, Jan 1981 Page(s): 120 - 122
Digital Object Identifier  
Summary: A simple proof using random partitions and typicality is given for Marton's coding theorem for broadcast channels.

» 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.