中文
相关论文

相关论文: Generalized Multiple Access Channels with Confiden…

200 篇论文

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

This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side…

信息论 · 计算机科学 2016-11-18 Behzad Asadi , Lawrence Ong , Sarah J. Johnson

In this work, we develop a pair of rate-diverse encoder and decoder for a two-user Gaussian multiple access channel (GMAC). The proposed scheme enables the users to transmit with the same codeword length but different coding rates under…

信息论 · 计算机科学 2021-03-23 Pingping Chen , Long Shi , Yi Fang , Francis C. M. Lau , Jun Cheng

The wiretap channel models secure communication between two users in the presence of an eavesdropper who must be kept ignorant of transmitted messages. The performance of such a system is usually characterized by its secrecy capacity which…

信息论 · 计算机科学 2017-09-07 Holger Boche , Rafael F. Schaefer , H. Vincent Poor

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages to two receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, where…

信息论 · 计算机科学 2009-10-20 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

The problem of multicasting multiple messages with the help of a relay, which may also have an independent message of its own to multicast, is considered. As a first step to address this general model, referred to as the compound multiple…

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

Communication over a classical multiple-access channel (MAC) with entanglement resources is considered, whereby two transmitters share entanglement resources a priori before communication begins. Leditzky et al. (2020) presented an example…

量子物理 · 物理学 2024-12-11 Uzi Pereg , Christian Deppe , Holger Boche

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…

信息论 · 计算机科学 2011-06-21 Yeow-Khiang Chia , Abbas El Gamal

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

In this paper we consider the achievable rate region of the Gaussian Multiple Access Channel (MAC) when suboptimal transmission schemes are employed. Focusing on the two-user MAC and assuming uncoded Pulse Amplitude Modulation (PAM), we…

信息论 · 计算机科学 2011-02-25 Rizwan Ghaffar , Dimitris Toumpakaris , Jungwon Lee

In this paper, we examine discrete memoryless Multiple Access Channels (MACs) with two-sided feedback in the presence of two correlated channel states that are correlated in the sense of Slepian-Wolf (SW). We find achievable rate region for…

信息论 · 计算机科学 2012-12-17 Saeed Hajizadeh , Ghosheh Abed Hodtani

This paper considers the Gaussian multiple access wiretap channel (GMAC-WT) with selfish transmitters, i.e., who are each solely interested in maximizing their individual secrecy rate. The question then arises as to whether selfish…

信息论 · 计算机科学 2024-06-10 Remi A. Chou , Aylin Yener

We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a…

信息论 · 计算机科学 2022-01-31 Remi A. Chou

We compare the strong secrecy capacities of Arbitrarily Varying Wiretap Channels (AVWCs) and General Arbitrarily Varying Wiretap Channels (GAVWCs) with their capacities under semantic secrecy constraint and other equivalent cryptographic…

信息论 · 计算机科学 2026-05-12 Holger Boche , Ning Cai , Yiqi Chen , Marc Geitz

This work considers the corner points of the capacity region of a two-user Gaussian interference channel (GIC). In a two-user GIC, the rate pairs where one user transmits its data at the single-user capacity (without interference), and the…

信息论 · 计算机科学 2015-04-09 Igal Sason

We consider a scenario in which $K$ transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless MAC while simultaneously escaping detection from an adversary who observes their…

信息论 · 计算机科学 2019-06-11 Keerthi Suria Kumar Arumugam , Matthieu R. Bloch

In this paper, we derive information-theoretic performance limits for secure and reliable communications over the general two-user discrete memoryless broadcast channel with side-information at the transmitter. The sender wishes to…

信息论 · 计算机科学 2011-09-27 K. G. Nagananda , Chandra R Murthy , Shalinee Kishore

We consider the problem of reliable communication over multiple-access channels (MAC) where the channel is driven by an independent and identically distributed state process and the encoders and the decoder are provided with various degrees…

信息论 · 计算机科学 2012-01-20 Nevroz Şen , Fady Alajaji , Serdar Yüksel , Giacomo Como

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…

信息论 · 计算机科学 2022-10-03 Jennifer Chakravarty , Oliver Johnson , Robert Piechocki

This paper considers the two-user Gaussian Causal Cognitive Interference Channel (GCCIC), which consists of two source-destination pairs that share the same channel and where one full-duplex cognitive source can causally learn the message…

信息论 · 计算机科学 2016-11-15 Martina Cardone , Daniela Tuninetti , Raymond Knopp , Umer Salim