English
Related papers

Related papers: Optimal Order of Encoding for Gaussian MIMO Multi-…

200 papers

In this paper, we study a routing problem on the Gaussian multiple relay channel, in which nodes employ a decode-and-forward coding strategy. We are interested in routes for the information flow through the relays that achieve the highest…

Information Theory · Computer Science 2010-04-15 Lawrence Ong , Mehul Motani

One key metric for physical layer security is the secrecy capacity. This is the maximum rate that a system can transmit with perfect secrecy. For a Multiple Input Multiple Output (MIMO) system (a newer technology for 5G, 6G and beyond) the…

Information Theory · Computer Science 2022-10-03 Jennifer Chakravarty , Oliver Johnson , Robert Piechocki

This letter considers a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel model with integrated services. Specifically, we combine two sorts of service messages, and serve them simultaneously: one multicast…

Information Theory · Computer Science 2016-11-29 Weidong Mei , Zhi Chen , Jun Fang

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

A two-transmitter Gaussian multiple access wiretap channel with multiple antennas at each of the nodes is investigated. The channel matrices at the legitimate terminals are fixed and revealed to all the terminals, whereas the channel matrix…

Information Theory · Computer Science 2012-03-08 Xiang He , Ashish Khisti , Aylin Yener

We investigate the $K$-user many-to-one interference channel with confidential messages in which the $K$th user experiences interference from all other $K-1$ users, and is at the same time treated as an eavesdropper to all the messages of…

Information Theory · Computer Science 2009-05-19 Xiang He , Aylin Yener

Strong secrecy capacity of compound wiretap channels is studied. The known lower bounds for the secrecy capacity of compound finite-state memoryless channels under discrete alphabets are extended to arbitrary uncertainty sets and continuous…

Information Theory · Computer Science 2015-09-09 Rafael F. Schaefer , Sergey Loyka

In this paper, we consider an intelligent reflecting surface (IRS) assisted Guassian multiple-input multiple-output (MIMO) wiretap channel (WTC), and focus on enhancing its secrecy rate. Due to MIMO setting, all the existing solutions for…

Information Theory · Computer Science 2020-07-29 Limeng Dong , Hui-Ming Wang

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…

Information Theory · Computer Science 2008-03-31 Ender Tekin , Aylin Yener

We consider a Gaussian MISO wiretap channel, where a multi-antenna source communicates with a single-antenna destination in the presence of a single-antenna eavesdropper. The communication is assisted by multi-antenna helpers that act as…

Information Theory · Computer Science 2012-09-20 Shuangyu Luo , Jiangyuan Li , Athina Petropulu

The problem of maximizing secrecy rate of multiple-input multiple-output multiple-eavesdropper (MIMOME) channels with arbitrary numbers of antennas at each node is studied in this paper. First, the optimization problem corresponding to the…

Information Theory · Computer Science 2020-11-03 Xinliang Zhang , Yue Qi , Mojtaba Vaezi

In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the…

Information Theory · Computer Science 2008-04-29 Ruoheng Liu , H. Vincent Poor

In wiretap channels the eavesdropper's channel state information (CSI) is commonly assumed to be known at transmitter, fully or partially. However, under perfect secrecy constraint the eavesdropper may not be motivated to feedback any…

Information Theory · Computer Science 2013-07-10 Pin-Hsun Lin , Chien-Li Su , Hsuan-Jung Su

We study the transmission of confidential messages across a wireless broadcast channel with K>2 receivers and K helpers. The goal is to transmit all messages reliably to their intended receivers while keeping them confidential from the…

Information Theory · Computer Science 2017-03-06 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos

We study the Gaussian multiple-input multiple-output (MIMO) wiretap channel, which consists of a transmitter, a legitimate user, and an eavesdropper. In this channel, the transmitter sends a common message to both the legitimate user and…

Information Theory · Computer Science 2010-05-05 Ersen Ekrem , Sennur Ulukus

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 considers an artificial noise (AN) aided secrecy rate maximization (SRM) problem for a multi-input single-output (MISO) channel overheard by multiple single-antenna eavesdroppers. We assume that the transmitter has perfect…

Information Theory · Computer Science 2011-04-22 Qiang Li , Wing-Kin Ma

The problem of jamming on multiple-input multiple-output (MIMO) Gaussian channels is investigated in this paper. In the case of a single target legitimate signal, we show that the existing result based on the simplification of the system…

Information Theory · Computer Science 2016-03-03 Jie Gao , Sergiy A. Vorobyov , Hai Jiang

In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the…

Information Theory · Computer Science 2007-07-13 Ruoheng Liu , H. Vincent Poor

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