English
Related papers

Related papers: The Generalized Multiple Access Channel with Confi…

200 papers

As a brain inspired wireless communication scheme, cognitive radio is a novel approach to promote the efficient use of the scarce radio spectrum by allowing some users called cognitive users to access the under-utilized spectrum licensed…

Information Theory · Computer Science 2014-02-21 Reza K. Farsani , Reza Ebrahimpour

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…

Information Theory · Computer Science 2023-06-22 Hao Xu , Kai-Kit Wong , Giuseppe Caire

In this paper we introduce the two-user asynchronous cognitive multiple access channel (ACMAC). This channel model includes two transmitters, an uninformed one, and an informed one which knows prior to the beginning of a transmission the…

Information Theory · Computer Science 2016-08-10 Michal Yemini , Anelia Somekh-Baruch , Amir Leshem

In this work we study the secrecy capacity of Gaussian multiple-input multiple-output (MIMO) wiretap channels (WTCs) with a finite memory, subject to a per-symbol average power constraint on the MIMO channel input. MIMO channels with finite…

Information Theory · Computer Science 2017-01-24 Nir Shlezinger , Daniel Zahavi , Yonathan Murin , Ron Dabora

The compound broadcast channel with confidential messages (BCC) generalizes the BCC by modeling the uncertainty of the channel. For the compound BCC, it is only known that the actual channel realization belongs to a pre-specified…

Information Theory · Computer Science 2014-11-05 Andrea Grigorescu , Holger Boche , Rafael F. Schaefer , H. Vincent Poor

In this paper, inner and outer bounds on the capacity region of two-user interference channels with two confidential messages have been proposed. By adding secure multiplex coding to the error correction method in [15] which achieves the…

Information Theory · Computer Science 2015-03-19 Xiaolin Li , Ryutaroh Matsumoto

We consider a two user multiple-access channel with an eavesdropper at the receiving end. We use previously transmitted messages as a key in the next slot till we achieve the capacity region of the usual Multiple Access Channel (MAC).

Information Theory · Computer Science 2014-11-03 Shahid Mehraj Shah , Vinod Sharma

In this paper, we present a general formula for the capacity region of a general interference channel with two pairs of users. The formula shows that the capacity region is the union of a family of rectangles, where each rectangle is…

Information Theory · Computer Science 2013-10-08 Xiao Ma , Lei Lin , Chulong Liang , Xiujie Huang , Baoming Bai

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

A new single-letter achievable rate region is proposed for the two-user discrete memoryless multiple-access channel(MAC) with noiseless feedback. The proposed region includes the Cover-Leung rate region [1], and it is shown that the…

Information Theory · Computer Science 2014-03-31 Ramji Venkataramanan , S. Sandeep Pradhan

We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the first problem, each encoder has a private message and both together have a common message to transmit. The encoders…

Information Theory · Computer Science 2014-06-05 Moritz Wiese , Holger Boche

A memoryless state-dependent multiple access channel (MAC) is considered where two transmitters wish to convey a respective message to a receiver while simultaneously estimating the respective channel state via generalized feedback. The…

Information Theory · Computer Science 2019-02-12 Mari Kobayashi , Hassan Hamad , Gerhard Kramer , Giuseppe Caire

In this paper, we study the achievable rate region of Gaussian multiuser channels with the messages transmitted being from finite input alphabets and the outputs being {\em quantized at the receiver}. In particular, we focus on the…

Information Theory · Computer Science 2011-02-15 Suresh Chandrasekaran , Saif K. Mohammed , A. Chockalingam

We study a two-user state-dependent generalized multiple-access channel (GMAC) with correlated states. It is assumed that each encoder has \emph{noncausal} access to channel state information (CSI). We develop an achievable rate region by…

Information Theory · Computer Science 2014-09-09 Mohammad Javad Emadi , Majid Nasiri Khormuji , Mikael Skoglund , Mohammad Reza Aref

In this paper, we consider the discrete memoryless interference channel with common information, in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers. We derive an…

Information Theory · Computer Science 2007-07-13 Jinhua Jiang , Yan Xin , Hari Krishna Garg

Motivated in part by the problem of secure multicast distributed storage, we analyze secrecy rates for a channel in which two transmitters simultaneously multicast to two receivers in the presence of an eavesdropper. Achievable rates are…

Information Theory · Computer Science 2020-08-04 Hassan ZivariFard , Matthieu Bloch , Aria Nosratinia

This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent, confidential messages and a common message. Each of the…

Information Theory · Computer Science 2016-11-17 Ruoheng Liu , Tie Liu , H. Vincent Poor , Shlomo Shamai

The K-user discrete memoryless (DM) broadcast channel (BC) with two nested multicast messages is studied in which one common message is to be multicast to all receivers and the second private message to a subset of receivers. The receivers…

Information Theory · Computer Science 2018-12-31 Mohamed Salman , Mahesh K. Varanasi

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

This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where p transmitters send private…

Information Theory · Computer Science 2013-02-17 Ali Haghi , Reza K. Farsani , Mohammad Reza Aref , Farokh Marvasti