Loading...
Please wait, while we are loading the content...
Similar Documents
The impact of finite-alphabet input on the secrecy-achievable rates for broadcast channel with confidential message (2014)
| Content Provider | CiteSeerX |
|---|---|
| Author | Mheich, Zeina Alberge, Florence Duhamel, Pierre |
| Description | This paper investigates the maximization of the secrecy-achievable rate region for the Gaussian broadcast channel with confidential message (BCCM) using finite input constel-lations. The maximization is done jointly over symbol posi-tions and their joint probabilities. The secrecy-achievable rate regions are given for various broadcast strategies which differ in their complexity of implementation. We compare these strategies in terms of improvement in achievable rates and we study the impact of finite input alphabet on the secrecy-achievable rates. It is shown that finite alphabet constraints may change well known results holding in the Gaussian case. Index Terms — Secrecy-achievable rate region, information-theoretic security, finite-input alphabet. In 2014 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2014 |
| File Format | |
| Language | English |
| Publisher Date | 2014-01-01 |
| Access Restriction | Open |
| Subject Keyword | Gaussian Case Secrecy-achievable Rate Information-theoretic Security Finite Input Constel-lations Finite-input Alphabet Secrecy-achievable Rate Region Joint Probability Symbol Posi-tions Finite Alphabet Constraint Finite-alphabet Input Index Term Secrecy-achievable Rate Region Confidential Message Finite Input Alphabet Broadcast Channel Gaussian Broadcast Channel Various Broadcast Strategy Achievable Rate |
| Content Type | Text |
| Resource Type | Article |
