MIMO Gaussian Broadcast Channels with Confidential and Common Messages

被引：24

作者：

Liu, Ruoheng ^{[1
]}

Liu, Tie ^{[2
]}

Poor, H. Vincent ^{[3
]}

Shamai , Shlomo ^{[4
]}

机构：

[1] Alcatel Lucent, Murray Hill, NJ 07974 USA

[2] Texas A&M Univ, Dept Elect & Comp Engn, College Stn, TX 77843 USA

[3] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA

[4] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel

来源：

2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY | 2010年

基金：

以色列科学基金会; 美国国家科学基金会;

关键词：

CAPACITY REGION; SECRECY CAPACITY;

D O I：

10.1109/ISIT.2010.5513775

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent, confidential messages and a common message. Each of the confidential messages is intended for one of the receivers but needs to be kept perfectly secret from the other, and the common message is intended for both receivers. It is shown that a natural scheme that combines secret dirty-paper coding with Gaussian superposition coding achieves the secrecy capacity region. To prove this result, a channel-enhancement approach and an extremal entropy inequality of Weingarten et al. are used.

引用

页码：2578 / 2582

页数：5

共 12 条

[1]

[Anonymous], P 45 ANN ALL C COMM

[2] An MMSE Approach to the Secrecy Capacity of the MIMO Gaussian Wiretap Channel [J].