Abstract
A four-receiver degraded broadcast channel with secrecy outside a bounded range is studied, over which a transmitter sends four messages to four receivers. In the model considered, the channel quality gradually degrades from receiver 4 to receiver 1, and receiver k is required to decode the first k messages for k = 1,⋯, 4. Furthermore, message 3 is required to be secured from receiver 1, and message 4 is required to be secured from receivers 1 and 2. The secrecy capacity region is established. The achievable scheme includes not only superposition, binning and embedded coding used in previous studies, but also rate splitting and sharing particularly designed for this model, which is shown to be critical to further enlarge the achievable region and enable the development of the converse proof.
| Original language | English (US) |
|---|---|
| Title of host publication | IEEE International Symposium on Information Theory - Proceedings |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1357-1361 |
| Number of pages | 5 |
| Volume | 2015-June |
| ISBN (Print) | 9781467377041 |
| DOIs | |
| State | Published - Sep 28 2015 |
| Event | IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong Duration: Jun 14 2015 → Jun 19 2015 |
Other
| Other | IEEE International Symposium on Information Theory, ISIT 2015 |
|---|---|
| Country | Hong Kong |
| City | Hong Kong |
| Period | 6/14/15 → 6/19/15 |
Keywords
- Broadcast channel
- rate sharing
- rate splitting
- secrecy capacity
ASJC Scopus subject areas
- Applied Mathematics
- Modeling and Simulation
- Theoretical Computer Science
- Information Systems