An achievable rate region for discrete memoryless broadcast channels with confidential messages

2008 ◽  
Author(s):  
Yi Cao ◽  
Biao Chen
Keyword(s):  
Broadcast Channels ◽  
Achievable Rate ◽  
Rate Region

scholarly journals Compress-and-Forward for Relay Broadcast Channels without Common Messages

2015 ◽  
Vol 15 (2) ◽  
pp. 97-110 ◽  
Author(s):  
Xiaoxia Song ◽  
Yong Li
Keyword(s):  
Relay Node ◽  
Broadcast Channels ◽  
Broadcast Channel ◽  
Achievable Rate ◽  
Decode And Forward ◽  
Rate Region ◽  
Gaussian Channels ◽  
Memoryless Channels ◽  
Peeling Off ◽  
Better Than

Abstract This paper is connected with compress-and-forward strategy for two-user relay broadcast channels without common messages, where the relay node has private messages from the source, in addition to aiding traditional communication from the source to the destination. For this channel we derive two achievable rate regions based on the compress-and-forward strategy in cases of discrete memoryless channels and Gaussian channels, respectively. The numerical results for Gaussian relay broadcast channel show that the inner bound based on the compress-and-forward strategy improves when all the messages without peeling off any components are compressed and sent to the receiver. It also verifies that the inner bound based on compress-and-forward strategy is better than that based on decode-and-forward strategy, when the relay node is near to the sink node. Moreover, the rate region of the broadcast channel improves considerably when the collaboration between the two receivers is allowed. So the relay node can provide residual resources to help the communication between the source and the sink after its communication rate is satisfied, which gives some insights to select an available relay node in a practical communication system.

scholarly journals A Class of Three-Receiver Broadcast Channels with Degraded Message Sets and Side Information

2013 ◽  
Vol 2013 ◽  
pp. 1-8
Author(s):  
Fangbiao Li ◽  
Zhi Xue
Keyword(s):  
Side Information ◽  
Broadcast Channels ◽  
Broadcast Channel ◽  
Achievable Rate ◽  
Secrecy Capacity ◽  
Capacity Region ◽  
Rate Region ◽  
Special Cases ◽  
Perfect Secrecy

We study a class of three-receiver discrete memoryless broadcast channel (DM-BC) with three degraded message sets and side information. We derive achievable rate region for this three-receive DM-BC with side information noncausally available at the transmitter. When the receivers follow a degradedness order, we determine the perfect secrecy capacity region of this class of three-receiver DM-BC with three degraded message sets and side information noncausally available at both the transmitter and the receiver. The achievable secrecy region of this paper subsumes Steinberg’s rate region for two-receiver degraded BC with the side information and the secrecy capacity region for one-receiver two-eavesdropper DM-BC with no side information as its special cases.

scholarly journals An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes

2016 ◽  
Vol 62 (3) ◽  
pp. 1250-1279 ◽  
Author(s):  
Arun Padakandla ◽  
Aria G. Sahebi ◽  
S. Sandeep Pradhan
Keyword(s):  
Achievable Rate ◽  
Interference Channel ◽  
Rate Region ◽  
Coset Codes ◽  
User Interference
Sign in / Sign up

Export Citation Format

Share Document