English
Related papers

Related papers: State-Dependent Multiple Access Channels with Feed…

200 papers

Coding for the causal cognitive radio channel, with the cognitive source subjected to a half-duplex constraint, is studied. A discrete memoryless channel model incorporating the half-duplex constraint is presented, and a new achievable rate…

Information Theory · Computer Science 2010-06-07 Debdeep Chatterjee , Tan F. Wong , Ozgur Oyman

We use the idea of dependence balance to obtain a new outer bound for the capacity region of the discrete memoryless multiple access channel with noiseless feedback (MAC-FB). We consider a binary additive noisy MAC-FB whose feedback…

Information Theory · Computer Science 2016-11-17 Ravi Tandon , Sennur Ulukus

In this paper we study the Z channel with side information non-causally available at the encoders. We use Marton encoding along with Gelfand-Pinsker random binning scheme and Chong-Motani-Garg-El Gamal (CMGE) jointly decoding to find an…

Information Theory · Computer Science 2015-06-03 Saeed Hajizadeh , Mostafa Monemizadeh

In this paper, we obtain a general achievable rate region and some certain capacity theorems for multiple-access relay channel (MARC), using decode and forward (DAF) strategy at the relay, superposition coding at the transmitters. Our…

Information Theory · Computer Science 2015-03-19 Mohammad Osmani-Bojd , Assadallah Sahebalam , Ghosheh Abed Hodtani

We prove that the ensemble the nested coset codes built on finite fields achieves the capacity of arbitrary discrete memoryless point-to-point channels. Exploiting it's algebraic structure, we develop a coding technique for communication…

Information Theory · Computer Science 2022-03-02 Arun Padakandla , Sandeep Pradhan

This paper studies channel coding for the discrete memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. A multi-letter successive decoding rule depending on an arbitrary non-negative decoding metric is…

Information Theory · Computer Science 2017-12-08 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

A memoryless state-dependent multiple-access channel (MAC) is considered, where two transmitters wish to convey their messages to a single receiver while simultaneously sensing (estimating) the respective states via generalized feedbacks.…

Information Theory · Computer Science 2022-04-01 Mehrasa Ahmadipour , Michele Wigger , Mari Kobayashi

In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second…

Information Theory · Computer Science 2016-07-13 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref

The physical layer security in the up-link of the wireless communication systems is often modeled as the multiple access wiretap channel (MAC-WT), and recently it has received a lot attention. In this paper, the MAC-WT has been re-visited…

Information Theory · Computer Science 2017-01-17 Bin Dai , Zheng Ma

We propose a new inner bound on the capacity region of a memoryless multiple-access channel that is governed by a memoryless state that is known strictly causally to the encoders. The new inner bound contains the previous bounds, and we…

Information Theory · Computer Science 2011-06-03 Amos Lapidoth , Yossef Steinberg

In this paper, we derive information-theoretic performance limits for three classes of two-user state-dependent discrete memoryless broadcast channels, with noncausal side-information at the encoder. The first class of channels comprises a…

Information Theory · Computer Science 2012-07-17 K. G. Nagananda , Chandra R. Murthy , Shalinee Kishore

We study the performance limits of state-dependent discrete memoryless channels with a discrete state available at both the encoder and the decoder. We establish the epsilon-capacity as well as necessary and sufficient conditions for the…

Information Theory · Computer Science 2014-07-16 Marco Tomamichel , Vincent Y. F. Tan

The problem of reliable communication over the multiple-access channel (MAC) with states is investigated. We propose a new coding scheme for this problem which uses quasi-group codes (QGC). We derive a new computable single-letter…

Information Theory · Computer Science 2017-02-09 Mohsen Heidari , Farhad Shirani , S. Sandeep Pradhan

We consider the capacity of memoryless finite-state multiple access channel (FS-MAC) with causal asymmetric noisy state information available at both transmitters and complete state information available at the receiver. Single letter inner…

Information Theory · Computer Science 2011-06-03 Nevroz Şen , Giacomo Como , Serdar Yüksel , Fady Alajaji

Communicating arbitrarily correlated sources over interference channels is considered in this paper. A sufficient condition is found for the lossless transmission of a pair of correlated sources over a discrete memoryless interference…

Information Theory · Computer Science 2009-11-12 Wei Liu , Biao Chen

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

We consider a two-user state-dependent multiaccess channel in which only one of the encoders is informed, non-causally, of the channel states. Two independent messages are transmitted: a common message transmitted by both the informed and…

Information Theory · Computer Science 2016-11-18 Abdellatif Zaidi , Shiva Prasad Kotagiri , J. Nicholas Laneman , Luc Vandendorpe

In this paper, we consider the finite-state multiple access channel (MAC) with partially cooperative encoders and delayed channel state information (CSI). Here partial cooperation refers to the communication between the encoders via…

Information Theory · Computer Science 2016-11-17 Ziv Goldfeld , Haim H. Permuter , Benjamin M. Zaidel

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…

Information Theory · Computer Science 2011-02-25 Rizwan Ghaffar , Dimitris Toumpakaris , Jungwon Lee

We characterize the fundamental limits of transmission of information over a Gaussian multiple access channel (MAC) with the use of variable-length feedback codes and under a non-vanishing error probability formalism. We develop new…

Information Theory · Computer Science 2018-01-10 Lan V. Truong , Vincent Y. F. Tan