English
Related papers

Related papers: K-Receiver Wiretap Channel: Optimal Encoding Order…

200 papers

In this paper, the error performance achieved by cooperative detection among K distributed receivers in a diffusion-based molecular communication (MC) system is analyzed and optimized. In this system, the receivers first make local hard…

Information Theory · Computer Science 2024-10-30 Yuting Fang , Adam Noel , Nan Yang , Andrew W. Eckford , Rodney A. Kennedy

We consider the wiretap channel, where the individual channel uses have memory or are influenced by an adversary. We analyze the explicit and computationally efficient construction of information-theoretically secure coding schemes which…

Cryptography and Security · Computer Science 2024-04-03 Esther Hänggi , Iyán Méndez Veiga , Ligong Wang

The role of multiple antennas for secure communication is investigated within the framework of Wyner's wiretap channel. We characterize the secrecy capacity in terms of generalized eigenvalues when the sender and eavesdropper have multiple…

Information Theory · Computer Science 2007-08-31 Ashish Khisti , Gregory Wornell

In this letter, we consider an intelligent reflecting surface (IRS) assisted Guassian multiple-input multiple-output (MIMO) wiretap channel in which a multi-antenna transmitter communicates with a multi-antenna receiver in the presence of a…

Information Theory · Computer Science 2020-02-05 Limeng Dong , Hui-Ming Wang

In this paper, we consider the energy-bandwidth allocation for a network with multiple broadcast channels, where the transmitters access the network orthogonally on the assigned frequency band and each transmitter communicates with multiple…

Information Theory · Computer Science 2014-10-13 Zhe Wang , Vaneet Aggarwal , Xiaodong Wang

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

This paper provides an explicit expression for the capacity region of the two-user broadcast Z channel and proves that the optimal boundary can be achieved by independent encoding of each user. Specifically, the information messages…

Information Theory · Computer Science 2008-10-20 Bike Xie , Miguel Griot , Andres I. Vila Casado , Richard D. Wesel

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

In this work, we consider a wireless network with K cooperating transmitters (TXs) serving jointly K receivers (RXs). Due to the practical limitations of the backhaul network, it is relevant to consider a setting where each TX receives its…

Information Theory · Computer Science 2014-07-01 Paul de Kerret , Richard Fritzsche , David Gesbert , Umer Salim

The rate maximization for the $K$-user interference channels (ICs) has been investigated extensively in the literature. However, the dual problem of minimizing the error probability with given signal modulations and/or data rates of the…

Information Theory · Computer Science 2014-05-30 Hieu Duy Nguyen , Rui Zhang , Sumei Sun

This paper investigates beamforming schemes designed to minimize the symbol error probability (SEP) for an authorized user while guaranteeing that the likelihood of an eavesdropper correctly recovering symbols remains below a predefined…

Signal Processing · Electrical Eng. & Systems 2025-04-08 Nam Nguyen , An Vuong , Thuan Nguyen , Thinh Nguyen

Wireless communication provides a wide coverage at the cost of exposing information to unintended users. As an information-theoretic paradigm, secrecy rate derives bounds for secure transmission when the channel to the eavesdropper is…

Information Theory · Computer Science 2016-11-17 Ashkan Kalantari , Mojtaba Soltanalian , Sina Maleki , Symeon Chatzinotas , Björn Ottersten

A fundamental problem in decentralized networked systems is to coordinate actions of different agents so that they reach a state of agreement. In such applications, it is additionally desirable that the actions at various nodes may not be…

Information Theory · Computer Science 2024-11-22 Viswanathan Ramachandran , Tobias J. Oechtering , Mikael Skoglund

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

In the secure groupcast problem, a transmitter wants to securely groupcast a message with the maximum rate to the first $N$ of $K$ receivers by broadcasting with the minimum bandwidth, where the $K$ receivers are each equipped with a key…

Information Theory · Computer Science 2020-06-11 Hua Sun

The sum secure degrees of freedom (s.d.o.f.) of two fundamental multi-user network structures, the K-user Gaussian multiple access (MAC) wiretap channel and the K-user interference channel (IC) with secrecy constraints, have been determined…

Information Theory · Computer Science 2016-11-17 Jianwei Xie , Sennur Ulukus

We consider achieving the rates in the capacity region of a multi-level 3-receiver broadcast channel, in which the second receiver is degraded with respect to the first receiver, with degraded message sets. We propose a two-level chaining…

Information Theory · Computer Science 2020-10-15 Karthik Nagarjuna Tunuguntla , Paul H. Siegel

This paper investigates simultaneous wireless information and power transfer (SWIPT) for multiuser multiple-input-single-output (MISO) secrecy channel. First, transmit beamfoming without artificial noise (AN) design is considered, where two…

Information Theory · Computer Science 2015-03-24 Zheng Chu , Martin Johnston , Stephane Le Goff

This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node…

Information Theory · Computer Science 2015-12-18 Pedro H. J. Nardelli , Hirley Alves , Carlos H. M. de Lima , Matti Latva-aho

This paper studies secure layered video transmission in a multiuser multiple-input single-output (MISO) beamforming downlink communication system. The power allocation algorithm design is formulated as a non-convex optimization problem for…

Information Theory · Computer Science 2016-11-17 Derrick Wing Kwan Ng , Robert Schober , Hussein Alnuweiri