Abstract
In this paper, we consider non-degraded discrete memoryless broadcast channels where two private messages as well as a common message are transmitted at rate R1, R2 and Ro respectively. The common message is for both receivers to decode; the private message is only for its intended receiver of which the other receiver shall be kept as ignorant as possible. Measuring ignorance by equivocation, we propose an achievable rate region (R1, R2, Ro, Re1, Re2) for this channel where Re1 and Re2 are the equivocation rates for the two receivers respectively. This result generalizes Csiszar and Kornerpsilas capacity region for broadcast channels with single private message, Liu et alpsilas result for broadcast channels with perfect secrecy, Gelpsilafand and Pinskerpsilas achievable rate region for broadcast channels with common message, and Martonpsilas achievable rate region for general broadcast channels.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
