期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 64, 期 3, 页码 2104-2120出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2018.2791995
关键词
Binning; broadcast channel; embedded coding; multi-user; secrecy capacity region
资金
- National Science Foundation CAREER Award [CCF-1026565, CCF-17-60889]
- National Science Foundation [CNS-1116932, CCF-1801846, CCF-16-65037, ECCS-16-60140, CNS-1702808, ECCS-1647198]
- European Commission
- European Union [694630]
The K-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends K messages to K receivers, and the channel quality gradually degrades from receiver K to receiver 1. Each receiver k is required to decode message W-1, ... , W-k, for 1 <= k <= K, and to be kept ignorant of Wk+2, ... , W-K, for k = 1, ... , K - 2. Thus, each message Wk is kept secure from receivers with at least 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 binning employed for each layer. Joint embedded coding and binning are employed to protect 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 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 of 2K variables from the order of K-2 bounds to obtain a close-form achievable rate region. An outer bound is developed that matches the achievable rate region, whose proof involves recursive construction of the rate bounds and exploits the intuition gained from the achievable scheme.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据