English
Related papers

Related papers: The MIMO Wiretap Channel Decomposed

200 papers

This paper considers a Gaussian multi-input multi-output (MIMO) wiretap channel with a legitimate transmitter, a legitimate receiver (Bob), an eavesdropper (Eve), and a cooperative jammer. All nodes may be equipped with multiple antennas.…

Information Theory · Computer Science 2024-07-03 Hao Xu , Kai-Kit Wong , Yinfei Xu , Giuseppe Caire

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

The MIMOME channel is a Gaussian wiretap channel in which the sender, receiver, and eavesdropper all have multiple antennas. We characterize the secrecy capacity as the saddle-value of a minimax problem. Among other implications, our result…

Information Theory · Computer Science 2007-10-09 Ashish Khisti , Gregory Wornell

A multi-input multi-output (MIMO) Gaussian channel with two transmit antennas and two receive antennas is studied that is subject to an input peak-power constraint. The capacity and the capacity-achieving input distribution are unknown in…

Information Theory · Computer Science 2024-01-31 Alex Dytso , Luca Barletta , Gerhard Kramer

This paper considers a Gaussian multi-input multi-output (MIMO) multiple access wiretap (MAC-WT) channel, where an eavesdropper (Eve) wants to extract the confidential information of all users. Assuming that both the legitimate receiver and…

Information Theory · Computer Science 2022-09-20 Hao Xu , Kai-Kit Wong , Giuseppe Caire

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

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

This work investigates the effect of finite-alphabet source input on the secrecy rate of a multi-antenna wiretap system. Existing works have characterized maximum achievable secrecy rate or secrecy capacity for single and multiple antenna…

Information Theory · Computer Science 2016-11-15 Shafi Bashar , Zhi Ding , Chengshan Xiao

The energy-optimal scheme is found for communicating one bit over a memoryless Gaussian channel with an ideal feedback channel. It is assumed that the channel is allowed to be used at most N times before decoding. The optimal…

Information Theory · Computer Science 2016-05-17 Bo Bernhardsson , Ather Gattami

We consider a Gaussian multiple-input multiple-output (MIMO) wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each node equipped with multiple antennas. We study the problem of finding the…

Information Theory · Computer Science 2009-09-15 Jiangyuan Li , Athina Petropulu

The problem of covert communication over Multiple-Input Multiple-Output (MIMO) Additive White Gaussian Noise (AWGN) channels is investigated, in which a transmitter attempts to reliably communicate with a legitimate receiver while avoiding…

Information Theory · Computer Science 2025-07-21 Shi-Yuan Wang , Matthieu R. Bloch

Optimal signaling for secrecy rate maximization in Gaussian MIMO wiretap channels is considered. While this channel has attracted a significant attention recently and a number of results have been obtained, including the proof of the…

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

Secret sharing over the fast-fading MIMO wiretap channel is considered. A source and a destination try to share secret information over a fast-fading MIMO channel in the presence of a wiretapper who also makes channel observations that are…

Information Theory · Computer Science 2009-09-12 Tan F. Wong , Matthieu Bloch , John M. Shea

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

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

MIMO technology is one of the most significant advances in the past decade to increase channel capacity and has a great potential to improve network capacity for mesh networks. In a MIMO-based mesh network, the links outgoing from each node…

Information Theory · Computer Science 2007-07-13 Jia Liu , Y. Thomas Hou

In a recent work, a capacity-achieving scheme for the common-message two-user MIMO broadcast channel, based on single-stream coding and decoding, was described. This was obtained via a novel joint unitary triangularization which is applied…

Information Theory · Computer Science 2011-06-01 Anatoly Khina , Ayal Hitron , Uri Erez

The capacity of a fixed Gaussian multiple-input multiple-output (MIMO) channel and the optimal transmission strategy under the total power (TP) constraint and full channel state information are well-known. This problem remains open in the…

Information Theory · Computer Science 2016-12-15 S. Loyka

We consider compound multi-input multi-output (MIMO) wiretap channels where minimal channel state information at the transmitter (CSIT) is assumed. Code construction is given for the special case of isotropic mutual information, which…

Information Theory · Computer Science 2019-10-09 Antonio Campello , Cong Ling , Jean-Claude Belfiore

Polar codes have been proven to be capacity achieving for any binary-input discrete memoryless channel, while at the same time they can reassure secure and reliable transmission over the single-input single-output wireless channel. However,…