English
Related papers

Related papers: Capacity of Finite-State Channels with Delayed Fee…

200 papers

In this paper, taking into account the effect of link delays, we investigate the capacity region of the Cognitive Interference Channel (C-IFC), where cognition can be obtained from either causal or non-causal generalized feedback. For this…

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

We derive a lower and upper bound on the reliability function of discrete memoryless multiple-access channel (MAC) with noiseless feedback and variable-length codes (VLCs). For the upper-bound, we use proof techniques of Burnashev for the…

Information Theory · Computer Science 2018-07-02 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

In this paper, we propose an approach to numerically compute the feedback capacity of stationary finite dimensional Gaussian channels and construct (arbitrarily close to) capacity-achieving feedback codes. In particular, we first extend the…

Information Theory · Computer Science 2018-01-15 Chong Li , Nicola Elia

This work investigates the effect of finite buffer sizes on the throughput capacity and packet delay of line networks with packet erasure links that have perfect feedback. These performance measures are shown to be linked to the stationary…

Information Theory · Computer Science 2016-11-15 Badri N. Vellambi , Nima Torabkhani , Faramarz Fekri

In this paper, first, we investigate the model of degraded broadcast channel with side information and confidential messages. This work is from Steinberg's work on the degraded broadcast channel with causal and noncausal side information,…

Information Theory · Computer Science 2016-11-17 Bin Dai , A. J. Han Vinck , Zhuojun Zhuang , Yuan Luo

We consider the discrete, time-varying broadcast channel with memory under the assumption that the channel states belong to a set of finite cardinality. We first define the physically degraded finite-state broadcast channel for which we…

Information Theory · Computer Science 2008-03-12 Ron Dabora , Andrea Goldsmith

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

In this paper, we investigate problems of communication over physically degraded, state-dependent broadcast channels (BCs) with cooperating decoders. Two different setups are considered and their capacity regions are characterized. First,…

Information Theory · Computer Science 2014-05-21 Lior Dikstein , Haim H. Permuter , Yossef Steinberg

The input-constrained binary erasure channel (BEC) with strictly causal feedback is studied. The channel input sequence must satisfy the $(0,k)$-runlength limited (RLL) constraint, i.e., no more than $k$ consecutive `$0$'s are allowed. The…

Information Theory · Computer Science 2017-12-08 Ori Peled , Oron Sabag , Haim H. Permuter

We derive upper and lower bounds on the reliability function for the common-message discrete memoryless broadcast channel with variable-length feedback. We show that the bounds are tight when the broadcast channel is stochastically…

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

A mechanism called switched feedback is introduced; under switched feedback, each channel output goes forward to the receiver(s) or back to the transmitter(s) but never both. By studying the capacity of the Multiple-Access Channel (MAC)…

Information Theory · Computer Science 2025-05-01 Oliver Kosut , Michael Langberg , Michelle Effros

We characterize the symmetric capacity to within 1.7075 bits/s/Hz for the two-user Gaussian interference channel with feedback. The result makes use of a deterministic model to provide insights into the Gaussian channel. We derive a new…

Information Theory · Computer Science 2009-01-26 Changho Suh , David Tse

Fast fading wireless networks with delayed knowledge of the channel state information have received significant attention in recent years. An exception is networks where channels are spatially correlated. This paper characterizes the…

Information Theory · Computer Science 2016-06-23 Alireza Vahid , Robert Calderbank

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 revisit the problem of finding the average capacity of the Gaussian feedback channel. First, we consider the problem of finding the average capacity of the analog Gaussian noise channel where the noise has an arbitrary…

Information Theory · Computer Science 2019-01-24 Ather Gattami

In many wireless systems, the channel state information at the transmitter (CSIT) can not be learned until after a transmission has taken place and is thereby outdated. In this paper, we study the benefits of delayed CSIT on a block-fading…

Information Theory · Computer Science 2014-01-29 Kasper Fløe Trillingsgaard , Petar Popovski

The capacity of the semideterministic discrete memoryless broadcast channel (SD-BC) with partial message side-information (P-MSI) at the receivers is established. In the setting without a common message, it is shown that P-MSI to the…

Information Theory · Computer Science 2017-05-30 Annina Bracher , Michèle Wigger

A class of burst noise-erasure channels which incorporate both errors and erasures during transmission is studied. The channel, whose output is explicitly expressed in terms of its input and a stationary ergodic noise-erasure process, is…

Information Theory · Computer Science 2017-05-05 Lin Song , Fady Alajaji , Tamás Linder

We study the following semi-deterministic setting of the joint source-channel coding problem: a deterministic source sequence (a.k.a. individual sequence) is transmitted via a memoryless channel, using delay-limited encoder and decoder,…

Information Theory · Computer Science 2021-09-29 Neri Merhav

This paper investigates the effective capacity of a point-to-point ultra-reliable low latency communication (URLLC) transmission over multiple parallel sub-channels at finite blocklength (FBL) with imperfect channel state information (CSI).…

Information Theory · Computer Science 2022-10-20 Hongsen Peng , Meixia Tao