English
Related papers

Related papers: Achievable Rate Regions for Discrete Memoryless In…

200 papers

We consider a basic joint communication and sensing setup comprising a transmitter, a receiver and a sensor. The transmitter sends a codeword to the receiver through a discrete memoryless channel, and the receiver is interested in decoding…

Information Theory · Computer Science 2024-12-09 Han Wu , Hamdi Joudeh

This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the 2-user Gaussian symmetric interference channel (GSIC). First, the problem is studied in…

Information Theory · Computer Science 2016-06-14 Parthajit Mohapatra , Chandra R. Murthy

This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than…

Information Theory · Computer Science 2017-06-14 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

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

This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passive eavesdropper.…

Information Theory · Computer Science 2016-11-18 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

This paper presents the achievable rate region frontiers for the n-user interference channel when there is no cooperation at the transmit nor at the receive side. The receiver is assumed to treat the interference as additive thermal noise…

Information Theory · Computer Science 2010-08-23 Mohamad Charafeddine , Aydin Sezgin , Arogyaswami Paulraj

We present an achievable rate region for the general three user discrete memoryless broadcast channel, based on nested coset codes. We characterize 3-to-1 discrete broadcast channels, a class of broadcast channels for which the best known…

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

One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are derived for this channel. As a first result, a noisy interference regime…

Information Theory · Computer Science 2013-02-08 Reza K. Farsani

We study the problem of joint information and energy transfer in a binary two-hop channel with an energy harvesting relay. We consider a finite battery size at the relay and energy loss in transmitting energy. In other words, to be able to…

Information Theory · Computer Science 2021-09-29 Ali H. Abdollahi Bafghi , Mahtab Mirmohseni , Mohammad Reza Aref

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

Information Theory · Computer Science 2008-07-30 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

This article examines the problem of state estimation over multi-terminal channels in an unreliable regime. More specifically, we consider two canonical settings. In the first setting, measurements of a common stochastic source need to be…

Information Theory · Computer Science 2023-08-31 Touraj Soleymani , Deniz Gündüz

The cognitive interference channel with unidirectional destination cooperation (CIFC-UDC) is a variant of the cognitive interference channel (CIFC) where the cognitive (secondary) destination not only decodes the information sent from its…

Information Theory · Computer Science 2011-02-21 Hsuan-Yi Chu , Hsuan-Jung Su

We propose a new coding scheme for the discrete memoryless two-user multi-access channel (MAC) with rate-limited feedback. Our scheme combines ideas from the Venkataramanan-Pradhan scheme for perfect feedback with ideas from the…

Information Theory · Computer Science 2015-03-12 Selma Belhadj Amor

The state-dependent memoryless channel (SDMC) is employed to model the integrated sensing and communication (ISAC) system, where the transmitter conveys messages to the receiver while simultaneously estimating the state parameter of…

Information Theory · Computer Science 2026-01-14 Lugaoze Feng , Guocheng Lv , Xunan Li , Ye Jin

This paper considers the achievable rate-exponent region of integrated sensing and communication systems in the presence of variable-length coding with feedback. This scheme is fundamentally different from earlier studies, as the coding…

Information Theory · Computer Science 2025-01-27 Ioannis Papoutsidakis , George C. Alexandropoulos

This paper investigates the capacity region of a discrete memoryless (DM) multiple access wiretap (MAC-WT) channel where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the…

Information Theory · Computer Science 2020-01-14 Hao Xu , Giuseppe Caire , Cunhua Pan

In this paper, we present a new cooperative communication scheme consisting of two users in half-duplex mode communicating with one destination over a discrete memoryless channel. The users encode messages in independent blocks and divide…

Information Theory · Computer Science 2011-06-03 Ahmad Abu Al Haija , Mai Vu

In this paper, we want to derive achievable secrecy rate regions for quantum interference channel with classical inputs under one-shot setting. The main idea to this end is to use the combination of superposition and rate splitting for…

Information Theory · Computer Science 2023-01-10 Hadi Aghaee , Bahareh Akhbari

This paper establishes the capacity region of a class of broadcast channels with random state in which each channel component is selected from two possible functions and each receiver knows its state sequence. This channel model does not…

Information Theory · Computer Science 2014-01-28 Hyeji Kim , Abbas El Gamal

This paper studies a Gaussian Z-interference channel with a rate-limited digital relay link from one receiver to another. Achievable rate regions are derived based on a combination of Han-Kobayashi common-private information splitting…

Information Theory · Computer Science 2012-04-26 Lei Zhou , Wei Yu