Abstract
A K-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends K messages respectively to K receivers, and the channel quality gradually degrades from receiver K to receiver 1. Each receiver k is required to decode messages W1, Wk, for 1 ≤ k ≤ K. Furthermore, each message Wk should be kept secure from receivers with two-level worse channel quality, i.e., receivers 1,., k-2. The secrecy capacity region is fully characterized. The achievable scheme designates one superposition layer to each message with random binning employed for each layer for protecting all upper-layer messages from lower-layer receivers. Furthermore, the scheme allows adjacent layers to share rates so that part of the rate of each message can potentially be shared with its immediate upper-layer message to enlarge the rate region. More importantly, an induction approach is developed to perform Fourier-Motzkin elimination over 2K variables among Θ(K2) bounds to obtain a close-form achievable rate region. A converse proof is developed that matches the achievable rate region, which involves recursive construction of the rate bounds.
Original language | English (US) |
---|---|
Title of host publication | 2016 IEEE Information Theory Workshop, ITW 2016 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 31-35 |
Number of pages | 5 |
ISBN (Electronic) | 9781509010905 |
DOIs | |
State | Published - Oct 21 2016 |
Event | 2016 IEEE Information Theory Workshop, ITW 2016 - Cambridge, United Kingdom Duration: Sep 11 2016 → Sep 14 2016 |
Other
Other | 2016 IEEE Information Theory Workshop, ITW 2016 |
---|---|
Country | United Kingdom |
City | Cambridge |
Period | 9/11/16 → 9/14/16 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Information Systems
- Software
- Signal Processing