English
Related papers

Related papers: Multiple-Input Multiple-Output Gaussian Broadcast …

200 papers

In this work we study the secrecy capacity of Gaussian multiple-input multiple-output (MIMO) wiretap channels (WTCs) with a finite memory, subject to a per-symbol average power constraint on the MIMO channel input. MIMO channels with finite…

Information Theory · Computer Science 2017-01-24 Nir Shlezinger , Daniel Zahavi , Yonathan Murin , Ron Dabora

In this paper, we study the degraded compound multi-receiver wiretap channel. The degraded compound multi-receiver wiretap channel consists of two groups of users and a group of eavesdroppers, where, if we pick an arbitrary user from each…

Information Theory · Computer Science 2009-10-19 Ersen Ekrem , Sennur Ulukus

This paper presents two different low-complexity methods for obtaining the secrecy capacity of multiple-input multiple-output (MIMO) wiretap channel subject to a sum power constraint (SPC). The challenges in deriving computationally…

Information Theory · Computer Science 2021-02-23 Anshu Mukherjee , Björn Ottersten , Le Nam Tran

We study a multi-antenna broadcast channel with two legitimate receivers and an external eavesdropper. We assume that the channel matrix of the eavesdropper is unknown to the legitimate terminals but satisfies a maximum rank constraint. As…

Information Theory · Computer Science 2016-11-15 Xiang He , Ashish Khisti , Aylin Yener

The problem of transmitting a common message to multiple users over the Gaussian multiple-input multiple-output broadcast channel is considered, where each user is equipped with an arbitrary number of antennas. A closed-loop scenario is…

Information Theory · Computer Science 2016-11-17 Anatoly Khina , Idan Livni , Ayal Hitron , Uri Erez

We consider a wiretap multiple-input multiple-output multiple-eavesdropper (MIMOME) channel, where agent Alice aims at transmitting a secret message to agent Bob, while leaking no information on it to an eavesdropper agent Eve. We assume…

Information Theory · Computer Science 2014-04-15 Francesco Renna , Nicola Laurenti , Stefano Tomasin

We study the secrecy capacity of a helper-assisted Gaussian wiretap channel with a source, a legitimate receiver, an eavesdropper and an external helper, where each terminal is equipped with multiple antennas. Determining the secrecy…

Information Theory · Computer Science 2015-09-16 Lingxiang Li , Zhi Chen , Jun Fang , and Athina P. Petropulu

We study private broadcasting of two messages to two groups of receivers over independent parallel channels. One group consists of an arbitrary number of receivers interested in a common message, whereas the other group has only one…

Information Theory · Computer Science 2013-01-01 Ashish Khisti , Tie Liu

In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel…

Information Theory · Computer Science 2010-07-28 Xiang He , Aylin Yener

This paper considers a multiple-input multiple-output (MIMO) Gaussian wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each equipped with multiple antennas. Perfect secrecy is achieved when…

Information Theory · Computer Science 2010-06-10 S. Ali. A. Fakoorian , A. Lee Swindlehurst

Multicasting is the general method of conveying the same information to multiple users over a broadcast channel. In this work, the Gaussian MIMO broadcast channel is considered, with multiple users and any number of antennas at each node. A…

Information Theory · Computer Science 2012-05-31 Idan Livni , Anatoly Khina , Ayal Hitron , Uri Erez

This paper considers a multiple-input multiple-output (MIMO) Gaussian wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each equipped with multiple antennas. In this paper, we first revisit…

Information Theory · Computer Science 2015-06-11 S. Ali A. Fakoorian , A. Lee Swindlehurst

In this paper we consider the secure transmission over the fast fading multiple antenna Gaussian broadcast channels with confidential messages (FMGBC-CM), where a multiple-antenna transmitter sends independent confidential messages to two…

Information Theory · Computer Science 2012-06-26 Pin-Hsun Lin , Chien-Li Su , Hsuan-Jung Su

This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an…

Information Theory · Computer Science 2015-12-01 Yanling Chen , O. Ozan Koyluoglu , Aydin Sezgin

Multiple antennas have been exploited for spatial multiplexing and diversity transmission in a wide range of communication applications. However, most of the advances in the design of high speed wireless multiple-input multiple output…

Information Theory · Computer Science 2017-04-26 Yongpeng Wu , Chengshan Xiao , Zhi Ding , Xiqi Gao , Shi Jin

We consider the broadcast phase of a three-node network, where a relay node establishes a bidirectional communication between two nodes using a spectrally efficient two-phase decode-and-forward protocol. In the first phase the two nodes…

Information Theory · Computer Science 2011-04-19 Rafael F. Wyrembelski , Tobias J. Oechtering , Igor Bjelakovic , Clemens Schnurr , Holger Boche

This paper establishes inner bounds on the secrecy capacity regions for the general 3-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be…

Information Theory · Computer Science 2011-06-21 Yeow-Khiang Chia , Abbas El Gamal

Optimal signalling over the Gaussian MIMO wire-tap channel is studied under the total transmit power constraint. A closed-form solution for an optimal transmit covariance matrix is obtained when the channel is strictly degraded. In…

Information Theory · Computer Science 2016-11-02 Sergey Loyka , Charalambos D. Charalambous

We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the…

Information Theory · Computer Science 2015-03-17 Alexandre J. Pierrot , Matthieu R. Bloch

We study the optimality of linear precoding for the two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel (BC) with confidential messages. Secret dirty-paper coding (SDPC) is optimal under an input covariance…

Information Theory · Computer Science 2013-04-18 Ali Fakoorian andA. Lee Swindlehurst