中文
相关论文

相关论文: The Gaussian Multiple Access Wire-Tap Channel with…

200 篇论文

The rate regions of many variations of the standard and wire-tap channels have been thoroughly explored. Secrecy capacity characterizes the loss of rate required to ensure that the adversary gains no information about the transmissions.…

信息论 · 计算机科学 2018-06-27 Jake Perazzone , Eric Graves , Paul Yu , Rick Blum

The two-user broadcast channel (BC) with receivers connected by bidirectional cooperation links of finite capacities, known as conferencing decoders, is considered. A novel capacity region outer bound is established based on multiple…

信息论 · 计算机科学 2025-08-12 Reza K. Farsani , Wei Yu

The Schalkwijk-Kailath (SK) scheme, which achieves the capacity of the point-to-point white Gaussian channel with feedback, is secure by itself and also achieves the secrecy capacity of the Gaussian wiretap channel with feedback, i.e., the…

信息论 · 计算机科学 2021-11-19 Bin Dai , Chong Li , Yingbin Liang , Zheng Ma , Shlomo Shamai

We investigate the fading cognitive multiple access wiretap channel (CMAC-WT), in which two secondary-user transmitters (STs) send secure messages to a secondary-user receiver (SR) in the presence of an eavesdropper (ED) and subject to…

信号处理 · 电气工程与系统科学 2020-03-31 Juening Jin , Chengshan Xiao , Meixia Tao , Wen Chen

We study the interaction between two interfering Gaussian 2-user multiple access channels. The capacity region is characterized under mixed strong--extremely strong interference and individually very strong interference. Furthermore, the…

信息论 · 计算机科学 2011-03-15 Anas Chaaban , Aydin Sezgin , Bernd Bandemer , Arogyaswami Paulraj

A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…

信息论 · 计算机科学 2016-11-18 O. Simeone , D. Gunduz , H. V. Poor , A. Goldsmith , S. Shamai

We find the secrecy capacity of the 2-2-1 Gaussian MIMO wire-tap channel, which consists of a transmitter and a receiver with two antennas each, and an eavesdropper with a single antenna. We determine the secrecy capacity of this channel by…

信息论 · 计算机科学 2016-11-17 Shabnam Shafiee , Nan Liu , Sennur Ulukus

A Gaussian multiple-input multiple-output wiretap channel in which the eavesdropper and legitimate receiver are equipped with arbitrary numbers of antennas and the transmitter has two antennas is studied in this paper. Under an average…

信息论 · 计算机科学 2017-07-21 Mojtaba Vaezi , Wonjae Shin , H. Vincent Poor

Computing capacity of Gaussian Interference Channel (GIC) is complex since knowledge of input distributions is needed to find the mutual information terms in closed forms, which should be optimized over input distributions and associated…

信息论 · 计算机科学 2020-12-09 Amir K. Khandani

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…

信息论 · 计算机科学 2009-05-19 Xiang He , Aylin Yener

In this paper, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) there is perfect causal feedback from the receiver to the…

信息论 · 计算机科学 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

This paper investigates the achievable region of a $K$-user discrete memoryless (DM) multiple access wiretap (MAC-WT) channel, where each user transmits both secret and open messages. All these messages are intended for Bob, while Eve is…

信息论 · 计算机科学 2024-07-03 Hao Xu , Kai-Kit Wong , Giuseppe Caire

This paper investigates the achievable region and precoder design for multiple access wiretap (MAC-WT) channels, where each user transmits both secret and open (i.e., non-confidential) messages. All these messages are intended for the…

信息论 · 计算机科学 2023-06-22 Hao Xu , Kai-Kit Wong , Giuseppe Caire

An information measure based on fractional partitions of a set is used to derive a general dependence balance inequality for communication. This inequality is used to obtain new upper bounds on reliable and secret rates for multiterminal…

信息论 · 计算机科学 2026-04-14 Amin Gohari , Gerhard Kramer

This paper considers the problem of the multiple-input multiple-output (MIMO) Gaussian broadcast channel with two receivers (receivers 1 and 2) and two messages: a common message intended for both receivers and a confidential message…

信息论 · 计算机科学 2016-11-17 Hung D. Ly , Tie Liu , Yingbin Liang

This paper derives outer bounds on the secrecy capacity region of the 2-user Z interference channel (Z-IC) with rate-limited unidirectional cooperation between the transmitters. First, the model is studied under the linear deterministic…

信息论 · 计算机科学 2016-04-12 Parthajit Mohapatra , Chandra R. Murthy , Jemin Lee

This paper studies the optimal points in the capacity region of Gaussian multiple access channels (GMACs) with constant fading, multiple antennas and various power constraints. The points of interest maximize general rate objectives that…

信息论 · 计算机科学 2016-01-15 Daniel Calabuig , Ramy H. Gohary , Halim Yanikomeroglu

The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general K-user interference channel. In this paper, we introduce information…

信息论 · 计算机科学 2015-03-17 Xiang He , Aylin Yener

The two-user multiple-input multiple-output (MIMO) Gaussian broadcast channel (BC) with common, private and confidential messages is considered. The transmitter sends a common message to both users, a confidential message to User 1 and a…

信息论 · 计算机科学 2019-05-29 Ziv Goldfeld , Haim H. Permuter

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…

信息论 · 计算机科学 2021-02-23 Anshu Mukherjee , Björn Ottersten , Le Nam Tran