Rate splitting and sharing for degraded broadcast channel with secrecy outside a bounded range

Shaofeng Zou; Yingbin Liang; Lifeng Lai; Shlomo Shamai

doi:10.1109/ISIT.2015.7282677

Rate splitting and sharing for degraded broadcast channel with secrecy outside a bounded range

Shaofeng Zou, Yingbin Liang, Lifeng Lai, Shlomo Shamai

Department of Electrical Engineering & Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Scopus citations

Abstract

A four-receiver degraded broadcast channel with secrecy outside a bounded range is studied, over which a transmitter sends four messages to four receivers. In the model considered, the channel quality gradually degrades from receiver 4 to receiver 1, and receiver k is required to decode the first k messages for k = 1,⋯, 4. Furthermore, message 3 is required to be secured from receiver 1, and message 4 is required to be secured from receivers 1 and 2. The secrecy capacity region is established. The achievable scheme includes not only superposition, binning and embedded coding used in previous studies, but also rate splitting and sharing particularly designed for this model, which is shown to be critical to further enlarge the achievable region and enable the development of the converse proof.

Original language	English (US)
Title of host publication	IEEE International Symposium on Information Theory - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1357-1361
Number of pages	5
Volume	2015-June
ISBN (Print)	9781467377041
DOIs	https://doi.org/10.1109/ISIT.2015.7282677
State	Published - Sep 28 2015
Event	IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong Duration: Jun 14 2015 → Jun 19 2015

Other

Other	IEEE International Symposium on Information Theory, ISIT 2015
Country	Hong Kong
City	Hong Kong
Period	6/14/15 → 6/19/15

Keywords

Broadcast channel
rate sharing
rate splitting
secrecy capacity

ASJC Scopus subject areas

Applied Mathematics
Modeling and Simulation
Theoretical Computer Science
Information Systems

Access to Document

10.1109/ISIT.2015.7282677

Fingerprint Dive into the research topics of 'Rate splitting and sharing for degraded broadcast channel with secrecy outside a bounded range'. Together they form a unique fingerprint.

Cite this

Rate splitting and sharing for degraded broadcast channel with secrecy outside a bounded range. / Zou, Shaofeng; Liang, Yingbin; Lai, Lifeng; Shamai, Shlomo.

IEEE International Symposium on Information Theory - Proceedings. Vol. 2015-June Institute of Electrical and Electronics Engineers Inc., 2015. p. 1357-1361 7282677.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Zou, S, Liang, Y, Lai, L & Shamai, S 2015, Rate splitting and sharing for degraded broadcast channel with secrecy outside a bounded range. in IEEE International Symposium on Information Theory - Proceedings. vol. 2015-June, 7282677, Institute of Electrical and Electronics Engineers Inc., pp. 1357-1361, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 6/14/15. https://doi.org/10.1109/ISIT.2015.7282677

@inproceedings{e31f59eb15504b42a996123ce16ce209,

title = "Rate splitting and sharing for degraded broadcast channel with secrecy outside a bounded range",

abstract = "A four-receiver degraded broadcast channel with secrecy outside a bounded range is studied, over which a transmitter sends four messages to four receivers. In the model considered, the channel quality gradually degrades from receiver 4 to receiver 1, and receiver k is required to decode the first k messages for k = 1,⋯, 4. Furthermore, message 3 is required to be secured from receiver 1, and message 4 is required to be secured from receivers 1 and 2. The secrecy capacity region is established. The achievable scheme includes not only superposition, binning and embedded coding used in previous studies, but also rate splitting and sharing particularly designed for this model, which is shown to be critical to further enlarge the achievable region and enable the development of the converse proof.",

keywords = "Broadcast channel, rate sharing, rate splitting, secrecy capacity",

author = "Shaofeng Zou and Yingbin Liang and Lifeng Lai and Shlomo Shamai",

year = "2015",

month = sep,

day = "28",

doi = "10.1109/ISIT.2015.7282677",

language = "English (US)",

isbn = "9781467377041",

volume = "2015-June",

pages = "1357--1361",

booktitle = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "IEEE International Symposium on Information Theory, ISIT 2015 ; Conference date: 14-06-2015 Through 19-06-2015",

}

TY - GEN

T1 - Rate splitting and sharing for degraded broadcast channel with secrecy outside a bounded range

AU - Zou, Shaofeng

AU - Liang, Yingbin

AU - Lai, Lifeng

AU - Shamai, Shlomo

PY - 2015/9/28

Y1 - 2015/9/28

N2 - A four-receiver degraded broadcast channel with secrecy outside a bounded range is studied, over which a transmitter sends four messages to four receivers. In the model considered, the channel quality gradually degrades from receiver 4 to receiver 1, and receiver k is required to decode the first k messages for k = 1,⋯, 4. Furthermore, message 3 is required to be secured from receiver 1, and message 4 is required to be secured from receivers 1 and 2. The secrecy capacity region is established. The achievable scheme includes not only superposition, binning and embedded coding used in previous studies, but also rate splitting and sharing particularly designed for this model, which is shown to be critical to further enlarge the achievable region and enable the development of the converse proof.

AB - A four-receiver degraded broadcast channel with secrecy outside a bounded range is studied, over which a transmitter sends four messages to four receivers. In the model considered, the channel quality gradually degrades from receiver 4 to receiver 1, and receiver k is required to decode the first k messages for k = 1,⋯, 4. Furthermore, message 3 is required to be secured from receiver 1, and message 4 is required to be secured from receivers 1 and 2. The secrecy capacity region is established. The achievable scheme includes not only superposition, binning and embedded coding used in previous studies, but also rate splitting and sharing particularly designed for this model, which is shown to be critical to further enlarge the achievable region and enable the development of the converse proof.

KW - Broadcast channel

KW - rate sharing

KW - rate splitting

KW - secrecy capacity

UR - http://www.scopus.com/inward/record.url?scp=84969812938&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84969812938&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2015.7282677

DO - 10.1109/ISIT.2015.7282677

M3 - Conference contribution

AN - SCOPUS:84969812938

SN - 9781467377041

VL - 2015-June

SP - 1357

EP - 1361

BT - IEEE International Symposium on Information Theory - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - IEEE International Symposium on Information Theory, ISIT 2015

Y2 - 14 June 2015 through 19 June 2015

ER -