中文
相关论文

相关论文: The Capacity of Less Noisy Cognitive Interference …

200 篇论文

In this paper, we propose a low-complexity, secrecy capacity achieving polar coding scheme for the cognitive interference channel with confidential messages (CICC) under the strong secrecy criterion. Existing polar coding schemes for…

信息论 · 计算机科学 2017-10-30 Mengfan Zheng , Wen Chen , Cong Ling

Calculating the capacity (with or without feedback) of channels with memory and continuous alphabets is a challenging task. It requires optimizing the directed information (DI) rate over all channel input distributions. The objective is a…

信息论 · 计算机科学 2020-05-19 Ziv Aharoni , Dor Tsur , Ziv Goldfeld , Haim Henry Permuter

The best known inner bound for the 2-user discrete memoryless interference channel is the Han-Kobayashi rate region. The coding schemes that achieve this region are based on rate-splitting and superposition coding. In this paper, we develop…

信息论 · 计算机科学 2015-02-17 Ritesh Kolte , Ayfer Özgür , Haim Permuter

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 propose two coding schemes for discrete memoryless broadcast channels (DMBCs) with rate-limited feedback from only one receiver. For any positive feedback rate and for the class of strictly less-noisy DMBCs, our schemes strictly improve…

信息论 · 计算机科学 2013-07-23 Youlong Wu , Michèle Wigger

We study the best known general inner bound[MAR '79] and outer bound[N-EG'07] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bound is identical to a weaker form of the outer…

信息论 · 计算机科学 2008-04-25 Chandra Nair , Vincent Wang Zizhou

In multi-user information theory it is often assumed that every node in the network possesses all codebooks used in the network. This assumption may be impractical in distributed ad-hoc, cognitive or heterogeneous networks. This work…

信息论 · 计算机科学 2014-10-03 Alex Dytso , Daniela Tuninetti , Natasha Devroye

The two-user Multiple Access Channel (MAC) with cooperative encoders and Channel State Information (CSI) is considered where two different scenarios are investigated: A two-user MAC with common message (MACCM) and a two-user MAC with…

信息论 · 计算机科学 2013-02-17 Reza K. Farsani , Farokh Marvasti

The best outer bound on the capacity region of the two-user Gaussian Interference Channel (GIC) is known to be the intersection of regions of various bounds including genie-aided outer bounds, in which a genie provides noisy input signals…

信息论 · 计算机科学 2017-04-20 Junyoung Nam

This paper investigates information-theoretic oblivious transfer via a discrete memoryless broadcast channel with one sender and two receivers. We analyze both non-colluding and colluding honest-but-curious user models and establish general…

信息论 · 计算机科学 2025-10-30 Hadi Aghaee , Christian Deppe , Holger Boche

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…

信息论 · 计算机科学 2011-06-03 Nevroz Şen , Giacomo Como , Serdar Yüksel , Fady Alajaji

To study the effect of lack of up-to-date channel state information at the transmitters (CSIT), we consider two-user binary fading interference channels with Delayed-CSIT. We characterize the capacity region for such channels under…

信息论 · 计算机科学 2016-11-17 Alireza Vahid , Mohammad Ali Maddah-Ali , Amir Salman Avestimehr

In this work, we examine cognitive radio networks, where secondary users may act as relays for messages sent by the primary user, hence offering performance improvement of primary transmissions, while at the same time obtaining more…

信息论 · 计算机科学 2019-08-29 Athanasios Papadopoulos , Nestor D. Chatzidiamantis , Leonidas Georgiadis

We study the interference channel with a signal cognitive relay. A signal cognitive relay knows the transmit signals (but not the messages) of the sources non-causally, and tries to help them communicating with their respective…

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

We study a two-user cognitive interference channel (CIC) where one of the transmitters (primary) has knowledge of a linear combination (over an appropriate finite field) of the two information messages. We refer to this channel model as…

信息论 · 计算机科学 2013-01-29 Song-Nam Hong , Giuseppe Caire

In this paper, we consider noncoherent random linear coding networks (RLCNs) as a discrete memoryless channel (DMC) whose input and output alphabets consist of subspaces. This contrasts with previous channel models in the literature which…

信息论 · 计算机科学 2010-01-13 Bartolomeu F. Uchoa-Filho , Roberto W. Nobrega

This paper investigates the fundamental limits of integrated sensing and communication (ISAC) systems with 1-bit receiver quantization. We analyze a Gaussian fading ISAC channel with separate communication and monostatic sensing links,…

信号处理 · 电气工程与系统科学 2026-05-04 Emmanuel Trinidad , Neil Irwin Bernardo

In this paper, the capacity of a diffusion based molecular communication network under the model of a Linear Time Invarient-Poisson (LTI-Poisson) channel is studied. Introduced in the context of molecular communication, the LTI-Poisson…

信息论 · 计算机科学 2014-10-17 Hamidreza Arjmandi , Gholamali Aminian , Amin Gohari , Masoumeh Nasiri Kenari , Urbashi Mitra

Computing capacity of Gaussian Interference Channel (GIC) is complex since knowledge of input distributions is needed to find the mutual information terms in closed forms, which should be optimized over input distributions and associated…

信息论 · 计算机科学 2020-12-09 Amir K. Khandani

We consider a state-dependent multiaccess channel (MAC) with state non-causally known to some encoders. We derive an inner bound for the capacity region in the general discrete memoryless case and specialize to a binary noiseless case. In…

信息论 · 计算机科学 2008-03-30 Shiva Prasad Kotagiri , J. Nicholas Laneman