English
Related papers

Related papers: An Achievable rate region for the $3-$user interfe…

200 papers

A point-to-point integrated sensing and communication (ISAC) system is considered where a transmitter conveys a message to a receiver over a discrete memoryless channel (DMC) and simultaneously estimates the state of the channel through the…

Information Theory · Computer Science 2025-01-14 Homa Nikbakht , Michèle Wigger , Shlomo Shamai , H. Vincent Poor

A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed generalized spatially coupled parallel concatenated codes (GSC-PCCs), is introduced. These codes are constructed by applying spatial coupling on parallel concatenated codes…

Information Theory · Computer Science 2022-02-25 Min Qiu , Xiaowei Wu , Jinhong Yuan , Alexandre Graell i Amat

In this paper, we study the capacity of the two-user multiple-input multiple-output (MIMO) linear deterministic interference channel (IC), with possible correlations within/between the channel matrices. The capacity region is characterized…

Information Theory · Computer Science 2012-07-10 Xiaoli Xu , Yong Zeng , Yong Liang Guan , Tracey Ho

This letter produces a family of rate-compatible protograph-based LDPC codes approaching the independent and uniformly distributed (i.u.d.) capacity of inter-symbol interference (ISI) channels. This problem is highly nontrivial due to the…

Information Theory · Computer Science 2013-06-26 Thuy Van Nguyen , Aria Nosratinia , Dariush Divsalar

An error correcting code ($\mathsf{ECC}$) allows a sender to send a message to a receiver such that even if a constant fraction of the communicated bits are corrupted, the receiver can still learn the message correctly. Due to their…

Data Structures and Algorithms · Computer Science 2021-11-09 Meghal Gupta , Yael Tauman Kalai , Rachel Zhang

Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is…

Information Theory · Computer Science 2007-07-13 Pierre Moulin , Ying Wang

In this paper, we introduce the Causal Cognitive Interference Channel With Delay (CC-IFC-WD) in which the cognitive user transmission can depend on $L$ future received symbols as well as the past ones. Taking the effect of the link delays…

Information Theory · Computer Science 2012-02-06 Mahtab Mirmohseni , Bahareh Akhbari , Mohammad Reza Aref

An achievable rate region is obtained for a primary multiple access network coexisting with a secondary link of one transmitter and a corresponding receiver. The rate region depicts the sum primary rate versus the secondary rate and is…

Information Theory · Computer Science 2015-03-18 John Tadrous , Mohammed Nafie

For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…

Information Theory · Computer Science 2012-06-21 Frederic Knabe , Aydin Sezgin

We present a method of constructing rate-compatible polar codes that are capacity-achieving with low-complexity sequential decoders. The proposed code construction allows for incremental retransmissions at different rates in order to adapt…

Information Theory · Computer Science 2016-01-29 Song-Nam Hong , Dennis Hui , Ivana Marić

Rate-compatible error-correcting codes (ECCs), which consist of a set of extended codes, are of practical interest in both wireless communications and data storage. In this work, we first study the lower bounds for rate-compatible ECCs,…

Information Theory · Computer Science 2017-05-22 Pengfei Huang , Yi Liu , Xiaojie Zhang , Paul H. Siegel , Erich F. Haratsch

We develop upper bounds on code size for an independent and identically distributed deletion and insertion channels for a given code length and target frame error probability. The bounds are obtained as a variation of a general converse…

Information Theory · Computer Science 2026-04-14 Ruslan Morozov , Tolga Mete Duman

Lattice coding techniques may be used to derive achievable rate regions which outperform known independent, identically distributed (i.i.d.) random codes in multi-source relay networks and in particular the two-way relay channel. Gains stem…

Information Theory · Computer Science 2016-11-17 Yiwei Song , Natasha Devroye , Huai-Rong Shao , Chiu Ngo

For discrete memoryless multiple-access channels, we propose a general definition of variable length codes with a measure of the transmission rates at the receiver side. This gives a receiver perspective on the multiple-access channel…

Information Theory · Computer Science 2011-02-28 Stephane Musy

In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…

Information Theory · Computer Science 2021-05-20 Somalatha U , Parthajit Mohapatra

In this paper, bounds to the rate-equivocation region for the general 3-receiver broadcast channel (BC) with degraded message sets, are presented for confidential messages to be kept secret from one of the receivers. This model is more…

Information Theory · Computer Science 2009-10-27 Li-Chia Choo , Kai-Kit Wong

We focus on a two-receiver Multiple-Input-Multiple-Output (MIMO) Broadcast Channel (BC) and Interference Channel (IC) with an arbitrary number of antennas at each node. We assume an imperfect knowledge of local Channel State Information at…

Information Theory · Computer Science 2017-06-06 Chenxi Hao , Borzoo Rassouli , Bruno Clerckx

This paper investigates the achievable rate region of the multiple-input single-output (MISO) interference channel aided by intelligent reflecting surfaces (IRSs). We exploit the the additional design degree of freedom provided by the…

Signal Processing · Electrical Eng. & Systems 2020-05-20 Wei Huang , Yong Zeng , Yongming Huang

We consider the problem of polar coding for transmission over $m$-user multiple access channels. In the proposed scheme, all users encode their messages using a polar encoder, while a joint successive cancellation decoder is deployed at the…

Information Theory · Computer Science 2016-11-17 Hessam Mahdavifar , Mostafa El-Khamy , Jungwon Lee , Inyup Kang

Previous works established the capacity region for some special cases of discrete memoryless degraded cognitive interference channel (CIC) with unidirectional destination cooperation (UDC). In this letter, we characterize the capacity…

Information Theory · Computer Science 2018-01-23 Mohammad Kazemi