中文
相关论文

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

200 篇论文

A multiple access channel and a point-to-point channel sharing the same medium for communications are considered. We obtain an outer bound for the capacity region of this setup, and we show that this outer bound is achievable in some cases.…

信息论 · 计算机科学 2010-11-01 Anas Chaaban , Aydin Sezgin

In this work, an explicit wiretap coding scheme based on polar lattices is proposed to achieve the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel. Firstly, polar lattices are used to construct secrecy-good…

信息论 · 计算机科学 2017-12-27 Ling Liu , Yanfei Yan , Cong Ling

This paper considers the problem of secret-key agreement with public discussion subject to a peak power constraint $A$ on the channel input. The optimal input distribution is proved to be discrete with finite support. The result is obtained…

信息论 · 计算机科学 2018-05-09 Marwen Zorgui , Zouheir Rezki , Basel Alomair , Mohamed-Slim Alouini

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

Incorporating the physical layer characteristics to secure communications has received considerable attention in recent years. Moreover, cooperation with some nodes of network can give benefits of multiple-antenna systems, increasing the…

信息论 · 计算机科学 2013-01-10 Meysam Mirzaee , Soroush Akhlaghi

In this paper, a two-user discrete memoryless multiple-access channel (DM-MAC) with correlated channel states, each known at one of the encoders is considered, in which each encoder transmits independent messages and tries to cooperate with…

To achieve perfect secrecy in a multiple-input multiple-output (MIMO) Gaussian wiretap channel (WTC), we need to find its secrecy capacity and optimal signaling, which involves solving a difference of convex functions program known to be…

信息论 · 计算机科学 2021-05-25 Anshu Mukherjee , Vaibhav Kumar , Eduard Jorswieck , Björn Ottersten , Le-Nam Tran

We investigate message identification over a K-sender Gaussian multiple access channel (K-GMAC). Unlike conventional Shannon transmission codes, the size of randomized identification (ID) codes experiences a doubly exponential growth in the…

信息论 · 计算机科学 2024-08-20 Yaning Zhao , Wafa Labidi , Holger Boche , Eduard Jorswieck , Christian Deppe

Security constraint results in \textit{rate-loss} in wiretap channels. In this paper we propose a coding scheme for two user Multiple Access Channel with Wiretap (MAC-WT), where previous messages are used as a key to enhance the secrecy…

信息论 · 计算机科学 2017-01-17 Shahid M. Shah , Vinod Sharma

A Gaussian multiple-input multiple-output (MIMO) wiretap channel model is considered. The input is a two-antenna transmitter, while the outputs are the legitimate receiver and an eavesdropper, both equipped with multiple antennas. All…

信息论 · 计算机科学 2011-07-28 Jiangyuan Li , Athina Petropulu

This paper deals with the problem of massive random access for Gaussian multiple access channel (MAC). We continue to investigate the coding scheme for Gaussian MAC proposed by A. Vem et al in 2017. The proposed scheme consists of four…

信息论 · 计算机科学 2018-03-23 Luiza Medova , Anton Glebov , Pavel Rybin , Alexey Frolov

Interference alignment has emerged as a powerful tool in the analysis of multi-user networks. Despite considerable recent progress, the capacity region of the Gaussian K-user interference channel is still unknown in general, in part due to…

信息论 · 计算机科学 2016-11-15 Or Ordentlich , Uri Erez , Bobak Nazer

The capacity region of the two-user Gaussian Interference Channel (IC) is studied. Three classes of channels are considered: weak, one-sided, and mixed Gaussian IC. For the weak Gaussian IC, a new outer bound on the capacity region is…

信息论 · 计算机科学 2008-01-09 Abolfazl S. Motahari , Amir K. Khandani

The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel…

信息论 · 计算机科学 2007-08-22 Yingbin Liang , H. Vincent Poor

A secret key agreement setup between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. The three users observe i.i.d.…

信息论 · 计算机科学 2012-04-16 Somayeh Salimi , Mikael Skoglund

We study the Gaussian multiple access channel with random user activity, in the regime where the number of users is proportional to the code length. The receiver may know some statistics about the number of active users, but does not know…

信息论 · 计算机科学 2025-10-21 Xiaoqi Liu , Pablo Pascual Cobo , Ramji Venkataramanan

The problem of secret sharing over the Gaussian wiretap channel is considered. A source and a destination intend to share secret information over a Gaussian channel in the presence of a wiretapper who observes the transmission through…

信息论 · 计算机科学 2016-11-18 Chan Wong Wong , Tan F. Wong , John M. Shea

A two-user symmetric Gaussian Interference Channel (IC) is considered in which a noiseless unidirectional link connects one encoder to the other. Having a constant capacity, the additional link provides partial cooperation between the…

信息论 · 计算机科学 2009-09-16 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is…

信息论 · 计算机科学 2021-04-29 Zheng Li , Sheng Yang , Shlomo Shamai

In this work, we derive achievable rate regions for the three-user interference channels with asymmetric transmitter cooperation and various decoding capabilities at the receivers. The three-user channel facilitates different ways of…

信息论 · 计算机科学 2011-02-23 K. G. Nagananda , Chandra R. Murthy