2014
DOI: 10.1109/tcomm.2014.2374604
|View full text |Cite
|
Sign up to set email alerts
|

Achievable Secrecy Rates for the Broadcast Channel with Confidential Message and Finite Constellation Inputs

Abstract: International audienceThis paper considers the Broadcast Channel with Confidential Message (BCCM) where the sender attempts to send altogether a common message to two receivers and a confidential message to one of them. The achievable rate regions are derived for the power-constrained Gaussian BCCM with finite input alphabet using various transmission strategies. Namely, time sharing, superposition modulation and superposition coding are used as broadcast strategies. For superposition modulation and superposit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 24 publications
(48 reference statements)
0
5
0
Order By: Relevance
“…The achievable rate region for a Gaussian broadcast channel with confidential messages is characterized for discrete inputs in [97]. In this scenario, the transmitter's objective is to send a common message to two receivers as well as to deliver a confidential message to one of them.…”
Section: A Multiuser and Multi-eve Network 1) Broadcast Channel Witmentioning
confidence: 99%
See 1 more Smart Citation
“…The achievable rate region for a Gaussian broadcast channel with confidential messages is characterized for discrete inputs in [97]. In this scenario, the transmitter's objective is to send a common message to two receivers as well as to deliver a confidential message to one of them.…”
Section: A Multiuser and Multi-eve Network 1) Broadcast Channel Witmentioning
confidence: 99%
“…In this scenario, the transmitter's objective is to send a common message to two receivers as well as to deliver a confidential message to one of them. Dissimilar to [32] and [33] where standard constellations are considered, in [97], the symbols are allowed to be arbitrary, and the achievable secrecy rate region is enlarged by optimizing the symbol positions and the probability distribution of the symbols. The shrinkage of the rate region due to employing PAM inputs is quantified with respect to the optimal Gaussian inputs, and a number of important behavioral differences between these cases are highlighted.…”
Section: A Multiuser and Multi-eve Network 1) Broadcast Channel Witmentioning
confidence: 99%
“…The achievable rate region for Gaussian broadcast channel with confidential messages is characterized for discrete inputs in [96]. In this scenario, the transmitter's objective is to send a common message to two receivers as well as to deliver a confidential message to one of them.…”
Section: A Multiuser and Multi-eve Network 1) Broadcast Channel With ...mentioning
confidence: 99%
“…In this scenario, the transmitter's objective is to send a common message to two receivers as well as to deliver a confidential message to one of them. Dissimilar to [32] and [33] where standard constellations are considered, in [96], the symbols are allowed to be arbitrary, and the achievable secrecy rate region is enlarged by optimizing the symbol positions and the probability distribution of the symbols. The shrinkage of the rate region due to employing PAM inputs is quantified with respect to the optimal Gaussian inputs, and a number of important behavioral differences between these cases are highlighted.…”
Section: A Multiuser and Multi-eve Network 1) Broadcast Channel With ...mentioning
confidence: 99%
“…A finite constellation over an amplify and forward relay channel with security constraints is studied in [12]. The secrecy rate region of a broadcast channel with confidential messages and finite alphabet inputs is studied in [13]. Very recently, the secrecy performance of an antenna selection aided multiple antenna wiretap channel was studied in [14], where the authors take input from binary PSK/quadrature PSK (BPSK/QPSK) constellations.…”
Section: Introductionmentioning
confidence: 99%