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 secrecyachievable 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 secrecyachievable rates. It is shown that finite alphabet constraints may change well known results holding in the Gaussian case.
Keywords : finite-input alphabet information theoretic security Secrecy-achievable rate region
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download
https://hal-supelec.archives-ouvertes.fr/hal-00990141
Contributor : Florence Alberge <>
Submitted on : Tuesday, May 13, 2014 - 10:39:26 AM
Last modification on : Monday, June 24, 2019 - 2:36:14 PM
Long-term archiving on : Monday, April 10, 2017 - 9:43:13 PM

File

Article_ICASSP_checked.pdf
Files produced by the author(s)

Identifiers

Collections

SUPELEC | SUP_LSS | SUP_TELECOMS | L2S

Citation

Zeina Mheich, Florence Alberge, Pierre Duhamel. The impact of finite-alphabet input on the secrecy-achievable rates for broadcast channel with confidential message. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2014), May 2014, Florence, Italy. pp.1-5, ⟨10.1109/icassp.2014.6854696 ⟩. ⟨hal-00990141⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

411

Files downloads

356

Contact

CCSD