The impact of finite-alphabet input on the secrecy-achievable rates for broadcast channel with confidential message

Zeina Mheich 1 Florence Alberge 1 Pierre Duhamel 1
1 Division Télécoms et Réseaux - L2S
L2S - Laboratoire des signaux et systèmes : 1289
Abstract : This paper investigates the maximization of the secrecy-achievable rate region for the Gaussian broadcast channel with confidential message (BCCM) using finite input constellations. The maximization is done jointly over symbol positions 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.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00951622
Contributor : Florence Alberge <>
Submitted on : Tuesday, February 25, 2014 - 1:52:23 PM
Last modification on : Monday, June 24, 2019 - 2:36:14 PM
Long-term archiving on : Sunday, May 25, 2014 - 11:05:46 AM

File

Article_ICASSP_checked.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00951622, version 1

Collections

Citation

Zeina Mheich, Florence Alberge, Pierre Duhamel. The impact of finite-alphabet input on the secrecy-achievable rates for broadcast channel with confidential message. 2013. ⟨hal-00951622⟩

Share

Metrics

Record views

384

Files downloads

305